Submission #1292597

#	Time	Username	Problem	Language	Result	Execution time	Memory
1292597		haha	Bigger segments (IZhO19_segments)	C++20	0 / 100	1 ms	572 KiB

segments

#include <bits/stdc++.h>
#define f first
#define s second
#define ll long long
using namespace std;
const int maxn=1e3+5;

int n;
int a[maxn];
int dp[maxn][maxn];
ll sum[maxn];

int 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];
        sum[i]=sum[i-1]+a[i];
    }
    int ans=0;
    for(int i=1;i<=n;i++) dp[1][i]=1;
    for(int i=2;i<=n;i++){
        for(int j=2;j<=i;j++){
            for(int u=1;u<j;u++){
                if(sum[i]-sum[j-1]>=sum[j-1]-sum[u-1]){
                    dp[j][i]=max(dp[j][i],dp[u][j-1]+1);
                }
            }
        }
    }
    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