Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- int main() {
- int n, cnt = 0, start = 0, end = 0, prev, temp = 0;
- int mx_start = 0, mx_end = 0;
- cin >> n;
- vector<int> v(n), idx;
- if (n == 0) {
- cout << "0 0";
- return 0;
- }
- for (int i = 0; i < n; ++i) {
- cin >> v[i];
- }
- prev = v[0];
- for (int i = 0; i < n; ++i) {
- if (prev == v[i]) {
- ++cnt;
- idx.push_back(i);
- } else {
- idx.clear();
- prev = v[i];
- cnt = 1;
- }
- if (cnt == 3) {
- start = idx[0] + 1;
- idx.erase(idx.begin());
- cnt = 2;
- }
- ++end;
- if (end - start > mx_end - mx_start) {
- mx_end = end;
- mx_start = start;
- }
- }
- cout << mx_start + 1 << ' ' << mx_end;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement