제출 #1172188

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1172188		AtabayRajabli	Bigger segments (IZhO19_segments)	C++20	37 / 100	0 ms	784 KiB

segments

#include <bits/stdc++.h>
#define int long long
#define all(v) v.begin(), v.end()
using namespace std;

const int sz = 3e3 + 1, inf = 1e18;
int n, a[sz];

signed main()
{                                                                  
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    
    cin >> n;
    for(int i = 1; i <= n; i++)
    {
        cin >> a[i];
        a[i] += a[i - 1];
    }
    vector<array<int, 2>> dp(n + 1, {0, 0});
    array<int, 2> cur = {0, 0};
    for(int i = 1; i <= n; i++) dp[i] = {1, -a[i]};
    for(int i = 1; i <= n; i++)
    {
        cur[1] -= a[i] - a[i - 1];
        cur = max(cur, dp[i]);
        int l = i + 1, r = n;
        while(l <= r)
        {
            int m = (l + r) >> 1;
            if(a[m] - a[i] >= -cur[1])
            {
                r = m - 1;
            }
            else
            {
                l = m + 1;
            }
        }
        int nxt = r + 1;
        if(i < nxt && nxt <= n) dp[nxt] = max(dp[nxt], {cur[0] + 1, -(a[nxt] - a[i])});
    }
    cout << (*max_element(all(dp)))[0];
}

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