제출 #1172051

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1172051		AtabayRajabli	Bigger segments (IZhO19_segments)	C++20	0 / 100	0 ms	328 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], dp[sz][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];
    }
    dp[1][1] = 1;
    for(int i = 1; i < n; i++)
    {
        for(int j = i; j < n; j++)
        {
            dp[i][j + 1] = max(dp[i][j + 1], dp[i][j]);
            int l = j + 1, r = n;
            while(l <= r)
            {
                int mid = (l + r) >> 1;
                if(a[mid] - a[j] >= a[j] - a[i - 1]) 
                    r = mid - 1;
                else 
                    l = mid + 1;    
            }
            int nxt = r + 1;
            if(j < nxt && nxt <= n) dp[j + 1][nxt] = max(dp[j + 1][nxt], dp[i][j] + 1);
        }
    }
    int ans = 0;
    for(int i = 1; i <= n; i++)
    {
        ans = max(ans, dp[i][n]);
    }
    cout << ans;
}

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