2510: Product

最新推荐文章于 2024-08-13 15:43:57 发布

HQD因为有趣所以做题

最新推荐文章于 2024-08-13 15:43:57 发布

阅读量584

点赞数

分类专栏： ACM_搜索文章标签： integer output input each ini

本文链接：https://blog.csdn.net/hqd_acm/article/details/5393879

版权

ACM_搜索专栏收录该内容

33 篇文章 0 订阅

订阅专栏

Status	In/Out	TIME Limit	MEMORY Limit	Submit Times	Solved Users	JUDGE TYPE
	stdin/stdout	1s	16384K	382	125	Standard

There are multiple test cases, the first line of each test case is a integer n. (2<=n<=20) The next line have n integers (every integer in the range [1,1000]). We can divide these n integers into two parts and get the sum of the integers in these two parts, define them as sumA and sumB. Please calc the max number of sumA*sumB and output it in a single line.

Sample Input

Sample Output

56
36

Hint

(5,3),(7)  sumA=8  sumB=7  sumA*sumB=56
(5),(3,7)  sumA=5  sumB=10 sumA*sumB=50
(3),(5,7)  sumA=3  sumB=12 sumA*sumB=36
(),(3,5,7) sumA=0  sumB=15 sumA*sumB=0
The max is 56.

Problem Source: xwbsw

This problem is used for contest: 120

#include<stdio.h>
#include<math.h>
using namespace std;
int sum,sum1,sum2,sum3,n,a[20];
void dfs(int depth,int nowsum)
{
if(depth==n)
{
  if(fabs(nowsum-sum3)<fabs(sum1-sum3)) sum1=nowsum;
  return;
}
if(nowsum>sum1) return;
dfs(depth+1,nowsum+a[depth]);
dfs(depth+1,nowsum);
}
int main()
{
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
while(scanf("%d",&n)!=EOF)
{
  sum=0;
  for(int i=0;i<n;i++)
  {
      scanf("%d",&a[i]);
      sum+=a[i];
  }
  sum3=sum/2;
  sum1=1<<25;
     dfs(0,0);
     sum2=sum-sum1;
  printf("%d/n",sum1*sum2);
}
return 0;
}