제출 #522901

#제출 시각아이디문제언어결과실행 시간메모리
522901snpmrnhlolBigger segments (IZhO19_segments)C++14
0 / 100
1 ms300 KiB
#include <iostream>

using namespace std;
int v[500000];
int main()
{
    long long n,s = 0,s2 = 0,bp,cnt = 1,i;
    cin>>n;
    for(i = 0;i < n;i++){
        cin>>v[i];
    }
    s = v[0];
    bp = 1;
    for(i = 1;i < n;i++){
        s2+=v[i];
        if(s <= s2){
            while(s <= s2){
                s+=v[bp];
                s2-=v[bp];
                bp++;
            }
            cnt++;
            bp--;
            s-=v[bp];
            s2+=v[bp];
            s = s2;
            bp = i + 1;
            s2 = 0;
        }
    }
    cout<<cnt;
    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...