제출 #743645

#제출 시각아이디문제언어결과실행 시간메모리
743645bgnbvnbvNizin (COCI16_nizin)C++14
100 / 100
69 ms10180 KiB
#include<bits/stdc++.h>
#define TASKNAME "codeforce"
#define pb push_back
#define pli pair<int,int>
#define fi first
#define se second
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL);
using namespace std;
using ll=long long;
const ll maxN=1e6+10;
const ll inf=1e18;
const ll mod=1e9+7;
ll a[maxN];

ll f(ll l,ll r)
{
    if(l>=r) return 0;
    ll i=l;
    ll j=r;
    ll sum1=a[i];
    ll sum2=a[j];
    while(j-i>1)
    {
        if(sum1==sum2) break;
        if(sum1<sum2) i++,sum1+=a[i];
        else j--,sum2+=a[j];
    }
    if(sum1!=sum2) return r-l;
    return (i-l)+(r-j)+f(i+1,j-1);
}
ll n;
void solve()
{
    cin >> n;
    for(int i=1;i<=n;i++)
    {
        cin >> a[i];
    }
    cout << f(1,n);
}
int main()
{
    fastio
    //freopen(TASKNAME".INP","r",stdin);
    //freopen(TASKNAME".OUT","w",stdout);
    solve();
}
#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...