#include <iostream> #include <vector> #include <algorithm> int main() { int n, k, t; std::cin >> n >> k >> t; std::vector<int> office(n, 0); std::vector<int> remote(n, 0); int prevOfficeSum = 0; int prevRemoteSum = 0; for(int i=0;i<n;i++) { char what; std::cin >> what; if (what == '1'){ prevOfficeSum++; } else if (what == '2') { prevRemoteSum++; } office[i] = prevOfficeSum; remote[i] = prevRemoteSum; } int maxPA = -1; int totalMeetingsCount = prevOfficeSum + prevRemoteSum; if (k >= totalMeetingsCount) { std::cout << n << std::endl; return 0; } int minMeetingsCount = totalMeetingsCount - k; if (prevOfficeSum<=k){ maxPA = n - minMeetingsCount; } for (int i = 0; i<n-t; i++){ for (int j = i+t+1; j<=n-t; j++){ int officeMeetingsDone = office[j-1] - office[i+t-1]; int remoteMeetingsDone = remote[j-1] - remote[i+t-1]; int possibleMissingsAtHome = (remote[i] - remote[0]) + (remote[n-1]-remote[j+t-1]); int hoursAtHome = n - (j+t-i); int meetingsLeft = std::max(0, minMeetingsCount - officeMeetingsDone - remoteMeetingsDone); if (meetingsLeft > possibleMissingsAtHome) continue; int newPA = hoursAtHome - meetingsLeft; maxPA = std::max(newPA, maxPA); } } std::cout << maxPA << std::endl; }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 | #include <iostream> #include <vector> #include <algorithm> int main() { int n, k, t; std::cin >> n >> k >> t; std::vector<int> office(n, 0); std::vector<int> remote(n, 0); int prevOfficeSum = 0; int prevRemoteSum = 0; for(int i=0;i<n;i++) { char what; std::cin >> what; if (what == '1'){ prevOfficeSum++; } else if (what == '2') { prevRemoteSum++; } office[i] = prevOfficeSum; remote[i] = prevRemoteSum; } int maxPA = -1; int totalMeetingsCount = prevOfficeSum + prevRemoteSum; if (k >= totalMeetingsCount) { std::cout << n << std::endl; return 0; } int minMeetingsCount = totalMeetingsCount - k; if (prevOfficeSum<=k){ maxPA = n - minMeetingsCount; } for (int i = 0; i<n-t; i++){ for (int j = i+t+1; j<=n-t; j++){ int officeMeetingsDone = office[j-1] - office[i+t-1]; int remoteMeetingsDone = remote[j-1] - remote[i+t-1]; int possibleMissingsAtHome = (remote[i] - remote[0]) + (remote[n-1]-remote[j+t-1]); int hoursAtHome = n - (j+t-i); int meetingsLeft = std::max(0, minMeetingsCount - officeMeetingsDone - remoteMeetingsDone); if (meetingsLeft > possibleMissingsAtHome) continue; int newPA = hoursAtHome - meetingsLeft; maxPA = std::max(newPA, maxPA); } } std::cout << maxPA << std::endl; } |