UVa 10487 - Closest Sums
来源:互联网 发布:大道无形 小千 知乎 编辑:程序博客网 时间:2024/05/18 02:43
链接:
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=113&page=show_problem&problem=1428
原题:
Given is a set of integers and then a sequence of queries. A query gives you a number and asks to find a sum of two distinct numbers from the set, which is closest to the query number.
Input
Input contains multiple cases.
Each case starts with an integer n (1<n<=1000), which indicates, how many numbers are in the set of integer. Next n lines contain n numbers. Of course there is only one number in a single line. The next line contains a positive integer m giving the number of queries, 0 <m < 25. The next m lines contain an integer of the query, one per line.
Input is terminated by a case whose n=0. Surely, this case needs no processing.
Output
Output should be organized as in the sample below. For each query output one line giving the query value and the closest sum in the format as in the sample. Inputs will be such that no ties will occur.
Sample input
5
3
12
17
33
34
3
1
51
30
3
1
2
3
3
1
2
3
3
1
2
3
3
4
5
6
0
Sample output
Case 1:
Closest sum to 1 is 15.
Closest sum to 51 is 51.
Closest sum to 30 is 29.
Case 2:
Closest sum to 1 is 3.
Closest sum to 2 is 3.
Closest sum to 3 is 3.
Case 3:
Closest sum to 4 is 4.
Closest sum to 5 is 5.
Closest sum to 6 is 5.
/* * 10487 - Closest Sums * Time: 0.152s * Author: D_Double */#include<iostream>#include<cstdio>#include<vector>#include<cmath>#include<algorithm>using namespace std;int arr[1005];vector<int>vt;vector<int>vt2;int main(){#ifndef ONLINE_JUDGE freopen("input.txt","r",stdin); freopen("output.txt","w",stdout);#endif int n,m,cas=1,q; while(scanf("%d",&n), n){ vt.clear(); for(int i=0; i<n; ++i) scanf("%d",&arr[i]); for(int i=0; i<n; ++i){ for(int j=i+1; j<n; ++j){ vt.push_back( arr[i]+arr[j] ); } } sort(vt.begin(), vt.end()); vt2.clear(); vt2.push_back(vt[0]); for(int i=1; i<vt.size(); ++i) if(vt[i]!=vt[i-1]) vt2.push_back(vt[i]); printf("Case %d:\n", cas++); scanf("%d",&m); for(int i=0; i<m; ++i){ scanf("%d", &q); vector<int>::iterator it; it = lower_bound(vt2.begin(), vt2.end(), q); if(*it==q) printf("Closest sum to %d is %d.\n", q, q); else { int min = *it; if(it!=vt2.begin() && abs(*(it-1)-q) < abs(min-q)) min = *(it-1); printf("Closest sum to %d is %d.\n", q, min); } } } return 0;}
—— 生命的意义,在于赋予它意义。
原创 http://blog.csdn.net/shuangde800 , By D_Double (转载请标明)
- UVa 10487 - Closest Sums
- UVa 10487 - Closest Sums
- uva 10487 - Closest Sums
- uva 10487 - Closest Sums
- UVa 10487 - Closest Sums
- UVa 10487 - Closest Sums
- UVa 10487 - Closest Sums
- uva 10487 - Closest Sums
- UVA 10487 - Closest Sums
- uva 10487 Closest Sums
- uva 10487 Closest Sums
- uva 10487 Closest Sums
- UVa 10487 - Closest Sums
- UVa 10487 - Closest Sums
- UVa-10487-Closest Sums
- UVA - 10487 Closest Sums
- uva-10487 - Closest Sums
- UVA - 10487 Closest Sums
- UVa 10700 - Camel trading
- HDU 2524 矩形A + B(矩阵)
- UVa 10340 - All in All
- hdu 2503 a/b + c/d(水)
- zoj1402-------------Magnificent Meatballs
- UVa 10487 - Closest Sums
- POJ 1548 最小路径覆盖
- UVa 10706 - Number Sequence
- hdu 1205 吃糖果(水)
- UVa 10057 - A mid-summer night's dream.
- UVa 10341 - Solve It
- zzuli 1254 矩阵相乘
- FreeBSD学习笔记(0006):PC不只是很便宜的工作站---丁磊
- UVa 270 - Lining Up