Submission #997621

#	Time	Username	Problem	Language	Result	Execution time	Memory
997621		Luvidi	Bigger segments (IZhO19_segments)	C++17	13 / 100	2 ms	2396 KiB

segments

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

#define ll long long
#define pll pair<ll, ll>
#define pii pair<int, int>
#define fs first
#define sc second
#define pb push_back

void solve() {
    int n;
    cin>>n;
    ll a[n+1],pre[n+1];
    pre[0]=0;
    for(int i=0;i<n;i++){
        cin>>a[i+1];
        pre[i+1]=pre[i]+a[i+1];
    }
    ll dp[n+1][n+1];
    int idx[n+1];
    for(int i=0;i<=n;i++){
        for(int j=0;j<=n;j++){
            dp[i][j]=1e18;
        }
        idx[i]=1e9;
    }
    dp[0][0]=0;
    idx[0]=0;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            if(idx[j-1]>=i)continue;
            if(pre[i]-pre[idx[j-1]]<dp[idx[j-1]][j-1])continue;
            int l=1,r=i-idx[j-1];
            while(l<r){
                int m=(l+r)/2;
                if(pre[i]-pre[i-m]>=dp[i-m][j-1])r=m;
                else l=m+1;
            }   
            dp[i][j]=pre[i]-pre[i-l];
            idx[j]=min(idx[j],i);
        }
    }
    
    ll ans=0;
    for(int i=1;i<=n;i++){
        if(dp[n][i]<1e18)ans=i;
    }
    cout<<ans;
}

int main() {   
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    solve();
}

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