http://poj.org/problem?id=2184
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 6753 | Accepted: 2366 |
Description
fun..."
- Cows with Guns by Dana Lyons
The cows want to prove to the public that they are both smart and fun. In order to do this, Bessie has organized an exhibition that will be put on by the cows. She has given each of the N (1 <= N <= 100) cows a thorough interview and determined two values for each cow: the smartness Si (-1000 <= Si <= 1000) of the cow and the funness Fi (-1000 <= Fi <= 1000) of the cow.
Bessie must choose which cows she wants to bring to her exhibition. She believes that the total smartness TS of the group is the sum of the Si's and, likewise, the total funness TF of the group is the sum of the Fi's. Bessie wants to maximize the sum of TS and TF, but she also wants both of these values to be non-negative (since she must also show that the cows are well-rounded; a negative TS or TF would ruin this). Help Bessie maximize the sum of TS and TF without letting either of these values become negative.
Input
* Lines 2..N+1: Two space-separated integers Si and Fi, respectively the smartness and funness for each cow.
Output
Sample Input
5 -5 7 8 -6 6 -3 2 1 -8 -5
Sample Output
8
Hint
Bessie chooses cows 1, 3, and 4, giving values of TS = -5+6+2 = 3 and TF
= 7-3+1 = 5, so 3+5 = 8. Note that adding cow 2 would improve the value
of TS+TF to 10, but the new value of TF would be negative, so it is not
allowed.
Source
状态转移方程:dp[j] = max(dp[j],dp[j-cost[i]+val[i]) (1<=i<=n,sumpos<=j<=sumneg),复杂度O(N*V)
在一般的01背包压缩空间的时候,体积的遍历是从大到小,因为dp[v]=max(dp[v],dp[v-c[i]]+w[i]),当前的dp[v]只取决于比自己小的dp[v-c[i]],所以从大到小遍历时每次dp[v-c[i]]和dp[v]都是上一次的状态。
如果体积为负v-c[i]>v,从大到小遍历dp[v-c[i]]是当前物品的状态,不是上一个,这样就会出错,解决的办法是从小到大遍历。注意由于smart可以是负的,要把smart整体加100*1000。当s[i]为负数时,从递增遍历,
因为01背包是每个物品只用一次的,而当si为负的时候,恰恰需要我们从小往大搜,保证每个si只用一次,这也是01背包和完全背包的重要区别
还有一种方法是为了避免数组开的太大用滚动数组http://hi.baidu.com/carl436/item/57d10363e25632137ddecca9
#include<stdio.h>
#include<string.h>
#define MAX 100*1001*2
#define N 105
#define INF 1000000000
int dp[MAX];
int s[N],f[N];
int n;
int max(int a,int b)
{
}
int main()
{
}