제출 #493904

#제출 시각아이디문제언어결과실행 시간메모리
493904KarabasanNizin (COCI16_nizin)C++17
100 / 100
72 ms10264 KiB
#include <bits/stdc++.h>
#define ll long long
#define fast1 ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
#define int long long
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC target("fma,sse,sse2,sse3,avx")
#pragma GCC optimize("unroll-loops")

int n;
int dizi[1000005];
void solve()
{
    cin>>n;
    for(int i=1;i<=n;i++)
        cin>>dizi[i];
    int i=1;
    int j=n;
    int cevap=0;
    while(i<j)
    {
        if(dizi[i]!=dizi[j])
        {
            if(dizi[i]<dizi[j])
            {
                dizi[i+1]=dizi[i]+dizi[i+1];
                i++;
                cevap++;
            }
            else
            {
                dizi[j-1]=dizi[j]+dizi[j-1];
                j--;
                cevap++;
            }
        }
        else
        {
            i++;
            j--;
        }
    }
    cout<<cevap;

}
signed main()
{
    fast1
    int t=1;
    //cin>>t;
    while(t--)
    {
        solve();
    }
    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...