Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <vector>
- #include <algorithm>
- using namespace std;
- int main()
- {
- int kd1, kd0, l, r, n1 = 0, n0 = 0, kb1, kb0;
- long p, q, n;
- cin » n » p » q;
- vector<int> v(n), sum(n);
- for (int i = 0; i < n; i++) {
- cin » v[i];
- if (i == 0) sum[0] = v[0];
- if (v[i]) {
- n1++;
- kd1 = i;
- }
- if (n1 == 1) kb1 = i;
- else {
- n0++;
- kd0 = i;
- }
- if (n0 == 0) kb0 = i;
- sum[i] = sum[i - 1] + v[i];
- }
- if (p > q) {
- l = kb1;
- r = kd1;
- }
- else {
- int l = kb0;
- int r = kd0;
- }
- while (sum[r] - sum[l - 1] < p && (r - l + 1) - (sum[r] - sum[l - 1]) < q) {
- if (sum[r] - sum[l - 1] < p && v[l - 1]) l--;
- else if (sum[r] - sum[l - 1] < p && v[r + 1]) r++;
- if ((r - l + 1) - (sum[r] - sum[l - 1]) < q && !(v[l-1])) l--;
- if ((r - l + 1) - (sum[r] - sum[l - 1]) < q && !(v[r + 1])) r++;
- }
- cout « l « " " « r;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement