Submission #1292583

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

segments

#include <bits/stdc++.h>
#define f first
#define s second
#define ll long long
using namespace std;
const int maxn=5e2+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++){
        for(int j=i;j>=1;j--){
            for(int u=j-1;u>=0;u--){
                for(int v=u;v>=0;v--){
                    if(sum[i]-sum[j-1]>=sum[u]-sum[max(0,v-1)]){
                        dp[i][j]=max(dp[i][j],dp[u][v]+1);
                    }
                }
            }
            ans=max(ans,dp[i][j]);
        }
    }
    cout<<ans;
}

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