# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
199578 | SamAnd | Preokret (COCI19_preokret) | C++17 | 6 ms | 380 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;
const int N = 255;
int n;
int a[N];
int main()
{
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
scanf("%d", &a[i]);
int q1 = 0, q2 = 0;
for (int i = 1; i <= n; ++i)
{
if (a[i] == 1)
++q1;
else
++q2;
}
printf("%d %d\n", q1, q2);
int ans1 = 1;
q1 = 0, q2 = 0;
for (int i = 1; i <= n; ++i)
{
if (a[i] == 1)
++q1;
else
++q2;
if (q1 == q2)
++ans1;
}
printf("%d\n", ans1);
int ans2 = 0;
q1 = 0, q2 = 0;
for (int i = 1; i <= n; ++i)
{
if (a[i] == 1)
++q1;
else
++q2;
if (q1 < q2)
{
int q = 0;
for (int j = i + 1; j <= n; ++j)
{
if (a[j] == 2)
break;
++q;
}
if (q1 + q > q2)
ans2 = max(ans2, q);
}
else if (q2 < q1)
{
int q = 0;
for (int j = i + 1; j <= n; ++j)
{
if (a[j] == 1)
break;
++q;
}
if (q2 + q > q1)
ans2 = max(ans2, q);
}
}
printf("%d\n", ans2);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |