Kile and Pogi have found N banknotes on the street. After making sure that the original owneris nowhere to be found, they decided to split the banknotes amongst themselves.In the end they want to “win” the same amount of money so they split thebanknotes in such a way. Of course, the sum of the banknotes nobody ends uphaving is the least possibleone.

Since they couldn’t justleave the remaining banknotes on the street, they decided to go to a nearbycasino and put everything on red, hoping that theywould end up getting twice the money they bet. The roulette decided on the(lucky, for this time) number 13 and our heroes decided to split the money theywon. The payout is such that Kile and Pogi will always be able to split themoney they won into two equal parts.

Because of the immense adrenaline rush, theboys have lost their mathematical abilities. Help them figure out how muchmoney each of them is taking home.

INPUT

The first line of input contains theinteger N (1 ≤ N ≤ 500) that denotes the number of banknotes on the street.

Each of thefollowing th N lines contains a single positive integer c i that denotes the value of the i banknote in kunas (kn). The total sum of money will not exceed 100000 kn.

OUTPUT

You must output the amount of money each of them took home.

SCORING

In test cases worth 50 points total, N will be less than orequal to 13.

In test cases worth 70 points total, N will be less than orequal to 50, and the total sum of money will be at most 1000 kn.

SAMPLE TESTS

input

2 3 1 6

2 3 5 8 13

output

题意：给你n个数求出一个最大的m 使得n个数能组成2个m 求sum-m

题解：定义dp[i][j]为前i个数差为j 组成2个m的数目前最大的那个是多少

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int dp[505][100005],a[505];
int main(){int n,i,j,sum=0;scanf("%d",&n);for(i=1;i<=n;i++){scanf("%d",&a[i]);sum+=a[i];}memset(dp,-1,sizeof(dp));dp[0][0]=0;for(i=1;i<=n;i++){for(j=0;j<=sum/2;j++){if(dp[i-1][j]!=-1)dp[i][j+a[i]]=max(dp[i-1][j]+a[i],dp[i][j+a[i]]);dp[i][j]=max(dp[i-1][j],dp[i][j]);if(j-a[i]<0){if(dp[i-1][j]!=-1)dp[i][abs(j-a[i])]=max(dp[i][abs(j-a[i])],dp[i-1][j]+abs(j-a[i]));}else{if(dp[i-1][j]!=-1)dp[i][j-a[i]]=max(dp[i-1][j],dp[i][j-a[i]]);}}}printf("%d\n",sum-dp[n][0]);return 0;
}

COCI 2016/2017 Round 4 C dp相关推荐

COCI 2016/2017 Round #3 题解
COCI 2016/2017 Round #3 这套题代码量似乎有些大呀...前五题代码都已经破4KB了... 而且还要卡空间.卡常数... Imena 题目翻译分析细节模拟题,注意可能会出现名字 ...
COCI 2016/2017 Round #5题解
COCI 2016/2017 Round #5 Tuna 题目翻译分析水题,按题意模拟即可. 参考代码 #include<cstdio> #include<algorithm&g ...
解题报告（一）D、（CROC 2016 - Final Round C）Binary Table（矩阵 + 状态压缩 + FWT）（3.5）
繁凡出品的全新系列:解题报告系列 -- 超高质量算法题单,配套我写的超高质量题解和代码,题目难度不一定按照题号排序,我会在每道题后面加上题目难度指数(1∼51 \sim 51∼5),以模板题难度 11 ...
Macbook pro 2016/2017 接入扩展坞时断 WIFI 问题的解决办法
Macbook pro 2016/2017 接入扩展坞时断 WIFI 问题的解决办法参考文章: (1)Macbook pro 2016/2017 接入扩展坞时断 WIFI 问题的解决办法 (2)ht ...
百度2016/2017秋招部分题目解析
今天把百度2016/2017秋招剩余的4星题目,以及少部分有难度或者比较有趣味的3星题目来一起分析下,所以这次就来个合集了(共包含了4个题目),总体来看题目比较简单,所以分析也会写得相对简略一些.尽管 ...
2017上半年计算机教学计划,2016—2017学年度第二学期信息技术教学计划
2016-2017学年度第二学期信息教学计划小学信息教学是一门极为重要的课程,顺应了时代需求,从小就要开始接触这门课程,才会适应社会的发展进步,开始肯定有点困难,但是希望大家能够保持学好的决心,能够 ...
哈师大计算机学院2016级新生,【通知公告】哈尔滨师范大学2016—2017学年度国家励志奖学金获奖学生初审名单公示...
原标题:[通知公告]哈尔滨师范大学2016-2017学年度国家励志奖学金获奖学生初审名单公示按照黑龙江省学生资助管理中心<关于上报2017年秋季高校奖学金评审等相关材料的通知>(黑教助中 ...
[转]KSN报告：2016 - 2017年的勒索软件
目录简要介绍一年内勒索软件的演变 Ransomware-as-a-Service的兴起针对性攻击的增长主要数字结论和预测预测反击本报告是使用卡巴斯基安全网络(KSN)处理的非个性化数据编 ...
Codeforces Beta Round #2--B题 (DP)
题目:The least round way 1000*1000的方阵,每个格子有一个非负整数,现在要从左上走到右下,每次只能向下或者向右走.目标是使得所有走的格子里的数的乘积里,末尾0的个数最少,要 ...
lonlifeOJ1152 “玲珑杯”ACM比赛 Round #19 概率DP
E -- Expected value of the expression DESCRIPTION You are given an expression: A0O1A1O2A2⋯OnAnA0O1A1 ...

COCI 2016/2017 Round 4 C dp

INPUT

OUTPUT

SCORING

SAMPLE TESTS

COCI 2016/2017 Round 4 C dp相关推荐

最新文章

热门文章