Submission #703477

#TimeUsernameProblemLanguageResultExecution timeMemory
703477delreyNizin (COCI16_nizin)C++14
100 / 100
146 ms10096 KiB
#include <iostream>

using namespace std;

long long n, a[1000000];

int main()
{
    cin>>n;
    for(int i = 0; i < n; i++)
        cin>>a[i];
    int l = 0, r = n - 1, res = 0;
    while(l < r)
    {
        if(a[l] == a[r])
        {
            l++;
            r--;
            continue;
        }
        if(a[l] < a[r])
        {
            a[l + 1] += a[l];
            l++;
        }
        else
        {
            a[r - 1] += a[r];
            r--;
        }
        res++;
    }
    cout<<res<<endl;
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...