题目链接:http://uva.onlinejudge.org/external/125/12563.pdf
思路:DP,用01背包的思路,每次记录下每个时间的最大歌曲数,最后找答案先满足歌曲数最大,在满足时间最大
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 55;
int T, n, t, sing[N], dp[11005];
int main() {
int cas = 0;
scanf("%d", &T);
while (T--) {
scanf("%d%d", &n, &t);
for (int i = 0; i < n; i++)
scanf("%d", &sing[i]);
sing[n++] = 678;......
阅读全文