Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <cstdio>
- #include <algorithm>
- using namespace std;
- int total[1000005],ma=-10,n,cnt[1000005];
- void find(){
- int prev=total[1],ind=0;
- for(int i=1;i<=n;i++){
- if(total[i]==0) continue;
- if(prev==total[i]) ind++;
- else if(prev!=total[i]){
- ma=max(ma,ind);
- ind=1;
- }
- prev=total[i];
- }
- if(ind!=0) ma=max(ma,ind);
- }
- int main()
- {
- scanf("%d",&n);
- for(int i=1;i<=n;i++){
- scanf("%d",&total[i]);
- cnt[total[i]]++;
- }
- for(int i=1;i<=n;i++){
- if(cnt[i]!=0){
- for(int j=1;j<=n;j++) if(total[j]==i) total[j]=0;
- find();
- for(int k=1;k<=n;k++) if(total[k]==0) total[k]=i;
- }
- }
- if(ma==-10) printf("0");
- else printf("%d",ma);
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement