# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
340275 | ammar2000 | Preokret (COCI19_preokret) | C++17 | 1 ms | 376 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |