Submission #770643

#	Time	Username	Problem	Language	Result	Execution time	Memory
770643		peteza	Bigger segments (IZhO19_segments)	C++14	0 / 100	1 ms	212 KiB

segments

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

int n;
vector<int> vec;

int main() {
    cin.tie(0) -> sync_with_stdio(0);
    cin >> n;
    vec.resize(n);
    for(int &e:vec) cin >> e;
    int cans = 1;
    for(int i=1;i<min(50, n);i++) {
        long long cur = 0;
        long long sum;
        int idx = i;
        for(int j=0;j<i;j++) cur += vec[j];
        int curcnt = 1;
        while(idx < n) {
            sum = 0;
            while(idx < n && sum < cur) sum += vec[idx++];
            if(sum >= cur) curcnt++;
            cur = sum;
        }
        cans = max(cans, curcnt);
    }
    cout << cans;
}

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