제출 #340275

#제출 시각아이디문제언어결과실행 시간메모리
340275ammar2000Preokret (COCI19_preokret)C++17
44 / 50
1 ms376 KiB
#include <bits/stdc++.h>
using namespace std;
int n,a,b,in[500],t,lws=1,ans;
int main()
{
 cin>>n;
 for (int i=0;i<n;i++)
 {
     cin>>in[i];
     if (in[i]==1)
        a++;
     else b++;
     if (a==b)
        t++;
     if (a&&b)
        {if (in[i]==in[i-1])
     {
         lws++;
     }
     else
     {
         ans=max(ans,lws);
         lws=1;
     }}
     if (a&&b)
        ans=max(ans,lws);
 }
 cout<<a<<" "<<b<<"\n";
 cout <<t+1<<"\n"<<ans;
  return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...