这是一道DP问题,个人觉得挺有意思的,呵呵……!
首先定义了一个dp[21][21][21]的三维数组。
dp[i][j][k]表示使用到了i张唱片,已刻录到了第j首歌,且当前正在刻录的唱片已占用了时间为k时的最优解。
状态转移方程为:
dp[i][j][k] = max{dp[i][j-1][k-data[j]]+1,dp[i][j-1][k],dp[i-1][j-1][kk]}
其中1<=kk<=k.
代码好下:
/*
ID: guo geer
PROG: rockers
LANG: C++
*/
#include<iostream>
#include<cstdio>
#include<cstring>
#include<fstream>
using namespace std;
int dp[21][21][21];
int data[21];
int main()
{
freopen("rockers.in", "r", stdin);
freopen("rockers.out", "w", stdout);
int n, t, m;
while(scanf("%d%d%d", &n, &t, &m) == 3)
{
for(int i=1; i<=n; i++) scanf("%d", &data[i]);
int temp = 0;
for(int i=1; i<=n; i++) if(data[i] <= t) data[++temp] = data[i];
n = temp;
if(m>n) m = n;
memset(dp, 0, sizeof(dp));
for(int i=1; i<=m; i++)
for(int j=1; j<=n; j++)
for(int k=1; k<=t; k++)
{
int Max = 0;
for(int tt=1; tt<=t; tt++)
if(dp[i-1][j-1][tt] > Max)
Max = dp[i-1][j-1][tt];
if(dp[i][j][data[j]] < Max+1)
dp[i][j][data[j]] = Max+1;
if(k>data[j]&&dp[i][j][k] < dp[i][j-1][k-data[j]]+1)
dp[i][j][k] = dp[i][j-1][k-data[j]]+1;
if(dp[i][j][k] < dp[i][j-1][k])
dp[i][j][k] = dp[i][j-1][k];
}
int res = 0;
for(int i=1; i<=n; i++)
for(int j=1; j<=t; j++)
if(dp[m][i][j] > res) res = dp[m][i][j];
printf("%d\n", res);
}
return 0;
}