Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- int main() {
- int n,a[1005]={},lung=1,lmax=0,x,y,st,dr; ///x,y poz solutiei
- cin >> n;
- for(int i=1;i<=n;i++){
- cin>>a[i];
- }
- st=1;dr=1;
- for(int i=1;i<=n-1;i++){
- if(a[i]==a[i+1]){
- lung++;
- dr=i+1;
- }
- else{
- if(lung >= lmax){ ///conteaza cea mai din dreapta secv
- lmax = lung;
- x=st;
- y=dr;
- }
- st=i+1;
- lung=1;
- }
- }
- if(lung>=lmax){
- lmax=lung;
- x=st;
- y=dr;
- };
- cout<<x<<" "<<y;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment