坑

4580

2427

附BZOJ4580代码

#include<iostream>
#include<cstring>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
 
using namespace std;
 
int n;
int dp[250][61];
 
int main()
{
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
    {
        int s;
        scanf("%d",&s);
        dp[i][s]=i;
        int len=s,pos=i-1;
        while(dp[pos][len])
        {
            dp[i][len+1]=dp[pos][len];
            pos=dp[pos][len]-1;
            len++;
        }
    }
    int ans=0;
    for(int i=1;i<=n;i++)
        for(int j=1;j<=60;j++)
            if(dp[i][j])ans=max(ans,j);
    cout<<ans;
    return 0;
}

flag:noip之后清坑

4810

1085

3142

3275