【动态规划】zoj Course Selection System

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

2310 15 12 1021 102 10

Sample Output

1910

Hint

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

For the second case, Edward should select no courses.

---

#include<cstdio>#include<cstring>#include<algorithm>#include<cstdlib>#include<queue>#include<cmath>#define mem(a,b) memset(a,b,sizeof(a))using namespace std;typedef long long ll;const int maxn=500105;ll dp[maxn],H[maxn],C[maxn];int main(){    int n;    ll sum;    int T;    while(~scanf("%d",&T))    {        while(T--)        {            mem(dp,0);            mem(H,0);            mem(C,0);            sum=0;            scanf("%d",&n);            for(int i=0;i<n;i++)                scanf("%lld%lld",&H[i],&C[i]);            for(int i=0;i<n;i++)                sum+=C[i];            for(int i=0;i<n;i++)            {                for(ll j=sum;j>=C[i];j--)                    dp[j]=max(dp[j],dp[j-C[i]]+H[i]);            }            ll ans=0;            for(int i=1;i<=sum;i++)            {                if(dp[i]<0)  continue;                ll the=dp[i]*dp[i]-i*dp[i]-i*i;                ans=max(ans,the);            }            printf("%lld\n",ans);        }    }    return 0;}