Poj 2184 Cow Exhibition
来源:互联网 发布:商品降价提醒功能源码 编辑:程序博客网 时间:2024/05/16 07:30
变形的01背包,其实问题的本质是保证智商和幽默感和不为负数情况下的最大和。智商属性体积,幽默感属性为价值,问题转换为 求体积大等于0时的体积、价值总和。
/*********************** * Author:fisty * Data:2014-11-7 * poj2184 * 01变形 * *******************/#include <cstdio>#include <cstring>#include <algorithm>using namespace std;#define MAX_N 201000int dp[MAX_N];int s[MAX_N], f[MAX_N];int main(){ int n; scanf("%d", &n); for(int i = 0;i < n; i++){ scanf("%d%d", &s[i], &f[i]); } for(int i = 0;i <= 200000; i++) dp[i] = -0x3f3f3f; dp[100000] = 0; for(int i = 0;i < n; i++){ if(s[i] > 0){ for(int j = 200000;j >= s[i]; j--){ dp[j] = max(dp[j], dp[j-s[i]] + f[i]); } }else{ for(int j = 0;j <= 200000+s[i]; j++){ dp[j] = max(dp[j], dp[j-s[i]] + f[i]); } } } int ans = 0; for(int i = 100000;i <= 200000; i++){ if(dp[i] >= 0 && dp[i]+i-100000 > ans){ ans = dp[i]+i-100000; } } printf("%d\n", ans); return 0;}
0 0
- poj 2184 Cow Exhibition
- POJ 2184 Cow Exhibition
- Poj 2184 Cow Exhibition
- poj 2184 Cow Exhibition
- poj 2184 Cow Exhibition
- POJ 2184 Cow Exhibition
- POJ-2184-Cow Exhibition
- POJ 2184 Cow Exhibition
- poj 2184 Cow Exhibition
- poj 2184 Cow Exhibition
- poj 2184 Cow Exhibition
- poj 2184--Cow Exhibition
- POJ 2184Cow Exhibition
- poj 2184 Cow Exhibition
- poj 2184:Cow Exhibition
- poj-2184-Cow Exhibition
- POJ 2184 Cow Exhibition
- Poj 2184 Cow Exhibition
- 希尔排序
- linux下ssh无密码登陆配置
- 这样找电子书,方法贴!
- 利用va_list,vfprintf等定义自己的文件输出函数
- ios8来了,屏幕更大,准备好使用 iOS Auto Layout了吗?
- Poj 2184 Cow Exhibition
- 阿萨德发生了法律上看风景阿隆索的空间返回拉萨
- JFreeChart在Struts2中实现柱状图统计
- 数学之美
- poj解题报告——1250
- PHP加载大文件时require和file_get_contents的性能对比
- 简单hexo安装与配置
- Android应用检测并下载更新新版本的方法
- Ubuntu下安装sublimeSublime Text