Submission #1349934

#	Time	Username	Problem	Language	Result	Execution time	Memory
1349934		tamir1	Bigger segments (IZhO19_segments)	C++20	13 / 100	19 ms	428 KiB

segments

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

#define int long long

signed main() {

    int n;
    cin >> n;

    vector<int> a(n);
    for(int i = 0; i < n; i++) cin >> a[i];
    int mx = 0;
    for(int i = 0; i < (1 << n); i++) {
        bool unen = 1;
        int cnt = 0;
        int sum = 0, prv = 0, set = ~i & 1;
        for(int j = 0; j < n; j++) {
            if(i & (1 << j)) {
                if(!set) {
                    if(sum < prv) {
                        unen = 0;
                        break;
                    }
                    cnt++;
                    prv = sum;
                    sum = a[j];
                    set = !set;
                } else {
                    sum += a[j];
                }
            } else {
                if(!set) {
                    sum += a[j];
                } else {
                    if(sum < prv) {
                        unen = 0;
                        break;
                    }
                    cnt++;
                    prv = sum;
                    sum = a[j];
                    set = !set;
                }
            }
        }
        if(unen && sum >= prv) mx = max(mx, cnt);
        // cout << cnt << " ";
    }
    cout << mx << "\n";
    return 0;
}

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