题意:给了数组s1,s2...sn和数组c1,c2...cn,求满足i<j<k且si<sj<sk的ci+cj+ck的最小值
分析:dp+暴力 ,我们用dp[i][j]表示用了i个数(i = 1,2,3)的前j个数的满足题意的最小值。用了i个数的前j个数的结果可以由用了i-1个数的前j个数的结果加上满足大小关系的第j个数得到。由此可以得到,状态转移方程为dp[i][j] = min(dp[i][j],dp[i - 1][k] + c[j])(s[j] > s[k]),初值为i=1的情况。
代码:
#include<bits/stdc++.h>
using namespace std;
const int maxn = 3010;
int a[maxn],b[maxn];
int dp[5][maxn];
const int INF = 0x3f3f3f3f;
int main()
{
int n;
cin>>n;
for(int i = 1; i <= 3; i++)
for(int j = 1; j <= n; j++)
dp[i][j] = INF;
for(int i = 1; i <= n; i++)
cin>>a[i];
for(int i = 1; i <= n; i++)
cin>>b[i];
for(int i = 1; i <= n; i++)
dp[1][i] = b[i];
for(int i = 2; i <= 3; i++)
{
for(int j = i; j <= n; j++)
{
for(int k = i - 1; k <= j; k++)
{
if(a[j] > a[k])
dp[i][j] = min(dp[i][j],dp[i - 1][k] + b[j]);
}
}
}
int minx = INF;
for(int i = 3; i <= n; i++)
minx = min(minx,dp[3][i]);
if(minx == INF)printf("-1\n");
else
cout<<minx<<endl;
return 0;
}