洛谷P1616 疯狂的采药 基础DP

题意：给T时间和M种草药，每种草药给出采摘用时及价值，每种都可以无限采摘，求出在给定时间可以得到的最多价值
思路：背包问题，用DP思想很容易想到O(T²)的方法，转移方程dp[i]=max(dp[i],dp[i-j]+dp[j])，就是用小于当前价值的所有时间求出当前时间的最大价值

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<vector>
#include<stack> 
#include<queue>
#include<map>
#include<algorithm>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int maxn = 1e6+10;
const int mod = 1e9+7;
const int inf = 0x3f3f3f3f;
int T, M, dp[maxn];
int main()
{
	while (~scanf("%d%d", &T, &M)) {
		memset(dp, 0, sizeof(dp));
		for (int i = 0; i < M; i++) {
			int t, val;
			scanf("%d%d", &t, &val);
			dp[t] = val;
		}
		for (int i = 0; i <= T; i++) {
			for (int j = 1; j <= i; j++) {
				dp[i] = max(dp[i], dp[i-j]+dp[j]);
			}
		}
		printf("%d\n", dp[T]);
	}
	return 0;
}

这种解法就算开O2优化也还有一个用例TLE，只能得86分，但背包问题的正解还是下面这种，复杂度为O(MT)

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<vector>
#include<stack> 
#include<queue>
#include<map>
#include<algorithm>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int maxn = 1e6+10;
const int mod = 1e9+7;
const int inf = 0x3f3f3f3f;
int T, M, dp[maxn], t[maxn], val[maxn];
int main()
{
	while (~scanf("%d%d", &T, &M)) {
		memset(dp, 0, sizeof(dp));
		for (int i = 0; i < M; i++) {
			scanf("%d%d", &t[i], &val[i]);
		}
		for (int i = 0; i < M; i++) {
			for (int j = t[i]; j <= T; j++) {
				dp[j] = max(dp[j], dp[j-t[i]]+val[i]);
			}
		}
		printf("%d\n", dp[T]);
	}
	return 0;
}