Educational Codeforces Round 60 (Rated for Div. 2) A. Best Subsegment(思维)

#include <bits/stdc++.h>
#define maxn 100005
using namespace std;
int pre[maxn];
int n;

int main()
{
  cin>>n;
  int ans = 0;
  for(int i=0;i<n;i++){
    cin>>pre[i];
    ans = max(ans, pre[i]);
  }
  int cnt = 0, sum = 0;
  for(int i=0;i<n;i++){
    if(pre[i] == ans) cnt ++;
    else sum = max(sum, cnt), cnt = 0;
  }
  sum = max(sum, cnt);
  cout<<sum<<endl;
  return 0;
}