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 a[1000007],n,x,sum,ans;
int main()
{
cin>>n;
for (int i=0; i<n; i++)
{
cin>>a[i];
}
for (int i=0; i<n/2; i++)
{
cout<<i<<" "<<a[i]<<" "<<a[n-i-1]<<" "<<n<<endl;
if (a[i]==a[n-1-i])
{
continue;
}
else
{
if (a[i]>a[n-i-1])
{
a[n-i-2]+=a[n-i-1];
ans++;
}
else
{
a[i+1]+=a[i];
ans++;
n++;
}
}
}
cout<<ans;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |