Submission #510225

#TimeUsernameProblemLanguageResultExecution timeMemory
510225khaled_whebeNizin (COCI16_nizin)C++17
100 / 100
54 ms10188 KiB
#include<bits/stdc++.h>
#define endl '\n'
typedef long long ll;
using namespace std;
const int N=5555555;
ll n,a[N],pre[N],suf[N],ans;
set <ll> st;
int main()
{
    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin>>n;
    for (ll i=0;i<n;i++){
        cin>>a[i];

    }
    ll i=0,j=n-1;
    while (i<j)
    {
        if (a[i]<a[j])
        {
            a[i+1]+=a[i];
            i++;
            ans++;
        }
        else if (a[i]>a[j])
        {
            a[j-1]+=a[j];
            j--;
            ans++;
        }
        else
        {
            i++;
            j--;
        }
    }
    cout<<ans<<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...