水题一道,一开始想错了,以为他是任意和,这个就比较麻烦了,需要DSF+回溯剪枝操作,但是这道题不是,这要任意两个和与给出的数最接近就行了,网上很多人用了求和排序再二分查找,其实用不着那么麻烦,只要求和时就 把所有的工作干完就行了,省时省空间。
#include <iostream>
#include<stdlib.h>
#include<math.h>
#include<stdio.h>
using namespace std;
int a[1000],n;
int foundconset(int);
int cmp_int(const void *a,const void *b)
{
int *i = (int *)a;
int *j = (int *)b;
return *i - *j;
}
int main()
{
int m,i,j,c,cas = 1;;
while((cin>> n) && n != 0)
{
for(i = 0; i < n; i++)
{
cin >> a[i];
}
cin >> m;
cout << "Case "<< cas <<":" << endl;
cas++;
for(j = 0; j < m;j++)
{
cin >> c;
cout << "Closest sum to "<< c << " is " << foundconset(c) <<"."<< endl;
}
}
return 0;
}
int foundconset(int c)
{
int i,j,low,hight,sum;
low = 111111111;
for(i = 0; i < n;i++)
for(j = i+1; j < n; j++)
{
sum = a[i] + a[j];
if(low > fabs(sum - c))
{
low =fabs(sum - c);
hight = sum;
}
}
return hight;
}