http://www.elijahqi.win/archives/3558
问连续的下标连续的最大i最后连续值是多少 i直接dp即可
设dp[i][j][k]表示前i个选了j个的最优值
#include<cstdio>
#include<algorithm>
#define ll long long
using namespace std;
const int N=3300;
ll dp[N][N][3],ans=1LL<<60;
int n,s[N],c[N];
int main(){
// freopen("c.in","r",stdin);
scanf("%d",&n);
for (int i=1;i<=n;++i) scanf("%d",&s[i]);
for (int i=1;i<=n;++i) scanf("%d",&c[i]);
for (int i=0;i<=n;++i)
for (int j=0;j<=n;++j)
for (int k=0;k<=2;++k) dp[i][j][k]=1LL<<60;
dp[0][0][0]=0;
for (int i=0;i<n;++i){
for (int j=0;j<=i;++j){
for (int k=0;k<=2;++k){
if (dp[i][j][k]==1LL<<60) continue;
dp[i+1][j][k]=min(dp[i+1][j][k],dp[i][j][k]);
if (s[i+1]>s[j]){
if (k!=2)
dp[i+1][i+1][k+1]=min(dp[i+1][i+1][k+1],dp[i][j][k]+c[i+1]);
else ans=min(ans,dp[i][j][k]+c[i+1]);
}
}
}
}
if (ans==1LL<<60) {puts("-1");return 0;}
else printf("%I64d\n",ans);
return 0;
}