ZOJ 3905 Cake(dp)
来源:互联网 发布:php 获取对象类型 编辑:程序博客网 时间:2024/05/18 01:36
Alice and Bob like eating cake very much. One day, Alice and Bob went to a bakery and bought many cakes.
Now we know that they have bought n cakes in the bakery. Both of them like delicious cakes, but they evaluate the cakes as different values. So they decided to divide those cakes by following method.
Alice and Bob do n / 2 steps, at each step, Alice choose 2 cakes, and Bob takes the cake that he evaluates it greater, and Alice take the rest cake.
Now Alice want to know the maximum sum of the value that she can get.
Input
The first line is an integer T which is the number of test cases.
For each test case, the first line is an integer n (1<=n<=800). Note that n is always an even integer.
In following n lines, each line contains two integers a[i] and b[i], where a[i] is the value of ith cake that Alice evaluates, and b[i] is the value of ith cake that Bob evaluates. (1<=a[i], b[i]<=1000000)
Note that a[1], a[2]..., a[n] are n distinct integers and b[1], b[2]..., b[n] are n distinct integers.
Output
For each test case, you need to output the maximum sum of the value that Alice can get in a line.
Sample Input
161 67 106 1112 1815 52 14
Sample Output
28
Author: HUA, Yiwei
/*思路: 按 b排序,那么转化为了 在n个物品中取n/2个,同时这n/2个取完前面有n/2个物品被取了 我们算你一个人可以取的最小值,dp[i][j] 代表取到i这个位置,对方已经取了j 个物品 那么剩下来的物品应该满足 n-i>= (need-j)*2+1,*/#include<cstdio>#include<cstring>#include<algorithm>#include<vector>#include<string>#include<iostream>#include<queue>#include<cmath>#include<map>#include<stack>#include<set>using namespace std;#define L(x) (x<<1)#define R(x) (x<<1|1)#define MID(x,y) ((x+y)>>1)const int INF=0x3f3f3f3f;typedef long long LL;#define INF 0x3f3f3f3f#define N 805int dp[N][N];int n;int va[N];struct stud{ int a,b; bool operator<(const stud s)const { return b>s.b; }}f[N];void solve(){ int i,j; memset(dp,INF,sizeof(dp)); dp[0][0]=0; int all=0; for(i=1;i<=n;i++) all+=va[i]; int need=n/2; for(i=1;i<=need;i++) for(j=i;j<=n;j++) for(int k=i-1;k<j;k++) { if(n-j<=(need-i)*2) continue; if(dp[k][i-1]>=INF) continue; dp[j][i]=min(dp[j][i],dp[k][i-1]+va[j]); } int ans=INF; for(int i=1;i<n;i++) ans=min(ans,dp[i][need]); printf("%d\n",all-ans);}int main(){ int i,j,t; scanf("%d",&t); while(t--) { scanf("%d",&n); for(i=1;i<=n;i++) scanf("%d%d",&f[i].a,&f[i].b); sort(f+1,f+n+1); for(i=1;i<=n;i++) va[i]=f[i].a; solve(); } return 0;}/*161 67 106 1112 1815 52 14*/
- ZOJ 3905 Cake(dp)
- ZOJ 3905 Cake(dp)
- ZOJ 3905 Cake (DP)
- zoj 3905 Cake(状压dp)
- ZOJ-3905-Cake【贪心】【dp】
- zoj 3537 Cake (凸包判定+区间dp)
- zoj 3537 Cake(三角划分dp+凸包)
- ZOJ 3537 Cake(凸包+区间DP)
- zoj 3905 Cake
- ZOJ 3905 Cake
- ZOJ 3537 Cake 凸包+dp
- ZOJ 3537 Cake 计算几何+区间dp
- Cake ZOJ
- Cake ZOJ
- zoj 3537 cake (区间DP+凸包+ 最优三角形剖分模型)
- zoj 3537 Cake (区间DP x 最优三角形剖分)
- ZOJ 3537-Cake(凸包+最优三角刨分+区间DP)
- 1629 - Cake slicing(DP)
- ASP.Net MVC(3)
- 项目管理小知识
- ios隐藏顶部状态和修改顶部状态栏字体颜色
- 23个经典的面向对象的设计模式与泡妞大法
- makeinfo is missing on your system
- ZOJ 3905 Cake(dp)
- 华为机试:输入法查找
- Spark 之Streaming--实例
- 黑马程序员——API中的小总结
- operator重载运算符(一)
- Tomcat内存设置详解
- 计算机网络笔记-TCP层
- SVN上传iOS @2x或@3x的图片时报svn E200009 Could not add all targets because some targets don't exist
- iOS学习之---个人总结C语言自学建议!