Submission #371089

#	Time	Username	Problem	Language	Result	Execution time	Memory
371089		nicolaalexandra	Bigger segments (IZhO19_segments)	C++14	0 / 100	1 ms	384 KiB

segments

#include <bits/stdc++.h>
#define DIM 500010
using namespace std;

int v[DIM];
int n,i;

int main (){

    //ifstream cin ("date.in");
    //ofstream cout ("date.out");

    cin>>n;
    for (i=1;i<=n;i++)
        cin>>v[i];

    long long sum = v[1]; int sol = 1;
    i = 1;
    while (i < n){

        int j = i; long long sum2 = 0;
        while (j < n && sum2 < sum){
            j++;
            sum2 += v[j];
        }

        if (sum2 < sum)
            break;

        while (i < j && sum + v[i+1] <= sum2 - v[i+1]){
            sum += v[i+1];
            sum2 -= v[i+1];
            i++;
        }


        i = j;
        sum = sum2;

        sol++;
    }

    cout<<sol;

    return 0;
}

• Subtask 1: 0 / 13
• Subtask 2: 0 / 14
• Subtask 3: 0 / 10
• Subtask 4: 0 / 36
• Subtask 5: 0 / 27