ZOJ 3956 Course Selection System 01背包

Course Selection System

---

Time Limit: 1 Second       Memory Limit: 65536 KB

---

There are n courses in the course selection system of Marjar University. The i-th course is described by two values: happiness H_i and credit C_i. If a student selects m courses x₁, x₂, ..., x_m, then his comfort level of the semester can be defined as follows:

Edward, a student in Marjar University, wants to select some courses (also he can select no courses, then his comfort level is 0) to maximize his comfort level. Can you help him?

Input

There are multiple test cases. The first line of input contains an integer T, indicating the number of test cases. For each test case:

The first line contains a integer n (1 ≤ n ≤ 500) -- the number of cources.

Each of the next n lines contains two integers H_i and C_i (1 ≤ H_i ≤ 10000, 1 ≤ C_i ≤ 100).

It is guaranteed that the sum of all n does not exceed 5000.

We kindly remind you that this problem contains large I/O file, so it's recommended to use a faster I/O method. For example, you can use scanf/printf instead of cin/cout in C++.

Output

For each case, you should output one integer denoting the maximum comfort.

Sample Input

2
3
10 1
5 1
2 10
2
1 10
2 10

Sample Output

191
0

Hint

For the first case, Edward should select the first and second courses.

For the second case, Edward should select no courses.

---

Author:  WANG, Yucheng
Source:  The 17th Zhejiang University Programming Contest Sponsored by TuSimple

思路

比较灵活的01背包

以C做为背包容量，dp[c]表示c容量的背包最大能获得的h，最后根据式子求最大值即可

AC代码

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <cctype>
#include <list>
#include <cmath>
#include <bitset>
#include <queue>
#include <stack>
#include <sstream>
#include <functional>
#include <cassert>
using namespace std;

#define tmax(a, b) if (b > a) a = b
#define tmin(a, b) if (b < a) a = b
char inc() { char _[10]; scanf("%s", _); return _[0]; }
int ini() { int _; scanf("%d", &_); return _; }
long long inll() { long long _; scanf("%I64d", &_); return _; }
double ind() { double _; scanf("%lf", &_); return _; }
string ins() { string _; cin >> _; return _; }
int inl(char _[]) { if (!fgets(_, (int)1e8, stdin)) return -1; int i = strlen(_); if (_[i - 1] == '\n') _[--i] = 0; return i; }

typedef pair<int, int> pii;
typedef pair<char, char> pcc;
typedef long long LL;
const int inf = 0x3f3f3f3f;
const LL lnf = 0x3f3f3f3f3f3f3f3f;
const double pi = 3.14159265358979323846;
const double eps = 1e-8;
const int mod = 100007;
const int maxn = 500 * 100 + 10;

int n;
int dp[maxn];

int main() {
	int CAS = 0;
	//std::ios::sync_with_stdio(0);
	//std::cin.tie(0);
#ifdef NIGHT_13
	//freopen("myout.txt", "w", stdout);
	freopen("in.txt", "r", stdin);
	int time_night_13 = clock();
#endif // NIGHT_13

	int t = ini();
	while (t--) {
		memset(dp, 0, sizeof dp);
		scanf("%d", &n);
		for (int i = 0; i < n; ++i) {
			int a, b;
			scanf("%d%d", &a, &b);
			for (int j = maxn - 10; j >= b; --j) {
				tmax(dp[j], dp[j - b] + a);
			}
		}
		LL ans = 0;
		for (int i = 0; i <= maxn - 10; ++i) {
			tmax(ans, (LL)dp[i] * dp[i] - (LL)dp[i] * i - (LL)i * i);
		}
		cout << ans << endl;
	}

#ifdef NIGHT_13
	fprintf(stderr, "\n-------------------------------------------\n");
	fprintf(stderr, "\t   Time: %dms", (int)clock() - time_night_13);
	fprintf(stderr, "\n-------------------------------------------\n\n");
#endif // NIGHT_13
	return 0;
}