WOJ1187-Difference Minimizing
来源:互联网 发布:c语言中用户标识符 编辑:程序博客网 时间:2024/06/05 22:47
Ginger's supervisor Mr. Zhang has great interest in arithmetic; today, Mr. Zhang left her a problem, the last problem of IPRAI's 2nd Round GS-Examination. Can you help the poor little girl to find out how to minimize the sum difference of two piles of numbers?
The problem seems so simple: there are K positive integers; her mission is to divide them into two piles, so that the sums of two piles are the closest.
输入格式
There are several test cases. Each test case contains two lines.
The first line contains an integer K (1 < K < 100) .
The second line contains K integers, X (1 < X < 100) .
输出格式
For each test case, print the minimum difference in one line.
样例输入
35 1 2618 5 5 5 5 2
样例输出
20
裸的01背包
#include<stdio.h>#include<stdlib.h>#include<string.h>int n,sum,target,*dp,data[100];int main(){ int i,j; while(~scanf("%d",&n)){ sum=0; for(i=0;i<n;i++){ scanf("%d",&data[i]); sum+=data[i]; } target=sum/2; dp=(int*)calloc(sum+1,4); dp[0]=1; for(i=0;i<n;i++) for(j=target;j>=data[i];j--) if(dp[j-data[i]]) dp[j]=1; for(i=target;i>=0;i--) if(dp[i]) break; printf("%d\n",sum-2*i); } return 0;}
阅读全文
0 0
- WOJ1187-Difference Minimizing
- minimizing the attack surface
- POJ 1769 Minimizing maximizer
- POJ 1769 Minimizing maximizer
- POJ 1769 Minimizing maximizer
- POJ 1769 Minimizing maximizer
- Minimizing Maximizer UVA
- Minimizing Compile-time Dependencies 1
- POJ 1769 Minimizing maximizer 笔记
- zoj2451-Minimizing maximizer(线段树,超时)
- Minimizing the Effect of Regular Updates
- poj 1769 Minimizing maximizer(线段树&dp)
- Minimizing maximizer - POJ 1769 dp+线段树
- poj 1769 Minimizing maximizer 线段树
- Swift:Minimizing Annotation with Type Inference
- poj1769 Minimizing maximizer线段树优化dp
- Minimizing quadratic energies with constant constraints
- #Poj1769#Minimizing maximizer(Dp+线段树优化)
- 二叉树
- C++ std::vector指定位置插入
- Law of Commutation HDU
- 视频播放问题总结
- mysql索引优缺点以及创建的时机
- WOJ1187-Difference Minimizing
- kshon学习笔记之android相对布局
- 美团前端一面
- 邝斌的ACM模板(自适应 simpson 积分)
- 习题 6.12 有一行电文,已按下面规律译成密码:A-Z a-z即第一个字母变成第26个字母,第i个字母变成第(26-i+1)个字母。非字母字符不变。要求编程序将密码译回原文,并输出密码和原文。
- 湖南省2017省赛A题
- redis哨兵模式和主从复制
- 单链表的创建算法
- centos 6.8 + pgsql 9.6 + pgagent