Educational Codeforces Round 60 (Div.2)

A.找到最大值x，再找出最长的连续的x。

 1 #include<cstdio>
 2 #include<cstring>
 3 #include<iostream>
 4 #include<algorithm>
 5 #define rep(i,l,r) for (int i=(l); i<=(r); i++)
 6 typedef long long ll;
 7 using namespace std;
 8 
 9 const int N=100010;
10 int n,tot,mx,ans,a[N];
11 
12 int main(){
13     scanf("%d",&n);
14     rep(i,1,n) scanf("%d",&a[i]),mx=max(mx,a[i]);
15     rep(i,1,n) if (a[i]==mx) tot++; else ans=max(ans,tot),tot=0;
16     printf("%d\n",max(ans,tot));
17     return 0;
18 }

A