题目分析
dp[i][j][0] 表示 前i个物品中有 j 个红色的 且第i个物品是 绿色的最小价值
dp[i][j][1] 表示 前i个物品中有 j 个红色的 且第i个物品是 红色的最小价值
d p [ i ] [ j ] [ 0 ] = m i n ( d p [ i − 1 ] [ j ] [ 0 ] , d p [ i − 1 ] [ j ] [ 1 ] + m i n ( h [ i − 1 ] , h [ i ] ) ) dp[i][j][0] = min( dp[i-1][j][0],dp[i-1][j][1] + min(h[i-1],h[i])) dp[i][j][0]=min(dp[i−1][j][0],dp[i−1][j][1]+min(h[i−1],h[i]))
d p [ i ] [ j ] [ 1 ] = m i n ( d p [ i − 1 ] [ j − h [ i ] ] [ 1 ] , d p [ i − 1 ] [ j − h [ i ] ] [ 0 ] + m i n ( h [ i − 1 ] , h [ i ] ) ) dp[i][j][1] = min( dp[i-1][j-h[i]][1],dp[i-1][j-h[i]][0] + min(h[i-1],h[i])) dp[i][j][1]=min(dp[i−1][j−h[i]][1],dp[i−1][j−h[i]][0]+min(h[i−1],h[i]))
代码详解
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 4e4+50;
int dp[205][maxn][2];
int h[maxn];
int main()
{
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
int n;
scanf("%d",&n);
int a,b;
scanf("%d%d",&a,&b);
memset(dp,0x3f,sizeof(dp));
int sum =0;
for(int i=1;i<=n;i++)
{
scanf("%d",&h[i]);
sum+=h[i];
}
dp[0][0][0] = dp[0][0][1] =0 ;
dp[1][0][0] = dp[1][h[1]][1] = 0;
for(int i=2;i<=n;i++)
{
for(int j=0;j<=a;j++)
{
//0 表示 第i块green ,1 表示 第i块为red
dp[i][j][0] = min(dp[i-1][j][0], (dp[i-1][j][1] + min(h[i],h[i-1])));
if(j>=h[i])
dp[i][j][1] = min(dp[i-1][j-h[i]][1],dp[i-1][j-h[i]][0]+min(h[i],h[i-1]));
}
}
int mi =max(sum-b,0);
int allans = 0x3f3f3f3f;
for(int i=mi;i<=a;i++)
{
allans = min(dp[n][i][0],allans);
allans = min(dp[n][i][1],allans);
}
if(allans == 0x3f3f3f3f) allans = -1;
printf("%d\n",allans);
return 0;
}