Submission #689403

#	Time	Username	Problem	Language	Result	Execution time	Memory
689403		Matteo_Verz	Bigger segments (IZhO19_segments)	C++17	13 / 100	5 ms	1236 KiB

segments

#include <bits/stdc++.h>
#ifdef BLAT
    #include "debug/debug.hpp"
#else
    #define debug(x...)
#endif

using namespace std;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int n;
    cin >> n;

    vector <int> v(1 + n);
    vector <long long> sp(1 + n);
    vector <vector <int>> dp(1 + n, vector <int>(1 + n, -1));

    int lastjump = 1;
    for (int i = 1; i <= n; i++) {
        cin >> v[i];
        sp[i] = sp[i - 1] + v[i];

        dp[i][1] = 0;
        int cp = lastjump;
        for (int jumps = 2; jumps <= n; jumps++) {
            dp[i][jumps] = max(dp[i][jumps], dp[i - 1][jumps]);
            // debug(i, jumps);
            int st = 1, dr = i - 1;
            while (st <= dr) {
                int mid = (st + dr) >> 1;
                if (dp[mid][jumps -1] == -1) st = mid + 1;
                else {
                    if (sp[i] - sp[mid] >= sp[mid] - sp[dp[mid][jumps - 1]]) {
                        dp[i][jumps] = mid;
                        st = mid + 1;
                    }
                    else dr = mid - 1;
                }
            }
            /*debug(i, jumps);
            for (int j = 1; j < i; j++) {
                debug(j, dp[j][jumps - 1]);
                if (dp[j][jumps - 1] != -1)
                    cerr << sp[i] - sp[j] << ' ' <<  sp[j] - sp[dp[j][jumps - 1]] << '\n';

                if (dp[j][jumps - 1] != -1 && sp[i] - sp[j] >= sp[j] - sp[dp[j][jumps - 1]]) {
                    dp[i][jumps] = j;
                    cp = max(cp, jumps);
                }
            }*/
        }

        lastjump = cp;
    }

    /*for (int i = 1; i <= n; i++, cerr << '\n')
        for (int j = 1; j <= n; j++) {
            cerr << dp[i][j] << '\t';
        }*/
    int maxjumps = 1;
    for (int i = 1; i <= n; i++)
        if (dp[n][i] != -1)
            maxjumps = max(maxjumps, i);
    
    cout << maxjumps << '\n';
    
    return 0;
}

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