제출 #535663

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
535663		MOUF_MAHMALAT	Cigle (COI21_cigle)	C++14	9 / 100	52 ms	1284 KiB

cigle

#include<bits/stdc++.h>
#define all(s) s.begin(),s.end()
#define F first
#define S second
using namespace std;
typedef int ll;
ll n,a[5009],dp[509][509],p[5009],ans;
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0),cout.tie(0);
    cin>>n;
    for(ll i=1; i<=n; i++)
    {
        cin>>a[i];
        p[i]=p[i-1]+a[i];
    }
    for(ll i=2; i<=n; i++)
    {
        for(ll j=i; j<=n; j++)
        {
            ll sum=0,l=i;
            dp[i][j]=dp[i-1][i-1];
            for(ll k=i-2; k; k--)
            {
                while(p[l]-p[i-1]<p[i-1]-p[k]&&l<j-1)
                    l++;
                if(p[l]-p[i-1]==p[i-1]-p[k]&&p[l]-p[i-1])
                    sum++;
                dp[i][j]=max(dp[i][j],dp[k][i-1]+sum);
            }
        }
    }
    for(ll i=1; i<=n; i++)
        ans=max(ans,dp[i][n]);
    cout<<ans;
    return 0;
}

• Subtask 1: 9 / 9
• Subtask 2: 0 / 11
• Subtask 3: 0 / 13
• Subtask 4: 0 / 15
• Subtask 5: 0 / 52