제출 #376318

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
376318		zaneyu	Bigger segments (IZhO19_segments)	C++14	27 / 100	63 ms	3052 KiB

segments

/*input
3
3 1 2
*/
#include<bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<n;i++)
#define ALL(x) x.begin(),x.end()
#define ll long long
#define pb push_back
#define pii pair<int,int>
#define REP1(i,n) for(int i=1;i<=n;i++)
#define f first
#define s second
#define sz(x) (int)x.size()
#define MXTO(x,y) x=max(x,y)
const int INF=0x3f3f3f3f;
const int maxn=5e2+5;

int dp[maxn][maxn];
int arr[maxn];
ll pref[maxn];
int32_t main(){
    ios::sync_with_stdio(false),cin.tie(0);
    int n;
    cin>>n;
    REP1(i,n){
        int x;
        cin>>x;
        pref[i]=pref[i-1]+x;
    }
    REP(i,n+1) REP1(j,n) dp[i][j]=-INF;
    for(int i=2;i<=n;i++){
        REP1(j,i-1){
            REP(k,j){
                if(pref[i]-pref[j]>=pref[j]-pref[k]){
                    MXTO(dp[i][j],dp[j][k]+1);
                }
            }
            //cout<<i<<' '<<j<<' '<<dp[i][j]<<'\n';
        }
    }
    int mx=0;
    REP1(i,n) MXTO(mx,dp[n][i]);
    cout<<mx+1;
}

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