Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <vector>
- using namespace std;
- vector <int> v;
- int main()
- {
- int n;
- cin >> n;
- v = vector <int> (n + 1);
- for (int i = 1; i <= n; ++i)
- cin >> v[i];
- int Lungime, LungimeMaxima = -1, BestStart = 0, BestStop = 0;
- for (int start = 1; start <= n; ++start)
- {
- for (int stop = start; stop <= n; ++stop)
- {
- while (v[start] == v[stop])
- {
- Lungime = stop - start + 1;
- if (Lungime > LungimeMaxima)
- {
- LungimeMaxima = Lungime;
- BestStart = start;
- BestStop = stop;
- }
- else
- {
- break;
- }
- }
- }
- }
- cout << BestStart << ' ' << BestStop;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement