Greatest Number
来源:互联网 发布:linux内核入门书籍 编辑:程序博客网 时间:2024/05/17 23:14
Greatest Number
Time Limit: 1000ms Memory limit: 65536K 有疑问?点这里^_^
题目描述
Saya likes math, because she think math can make her cleverer.
One day, Kudo invited a very simple game:
GivenN integers, then the players choose no more than four integers from them (can be repeated) and add them together. Finally, the one whose sum is the largest wins the game. It seems very simple, but there is one more condition: the sum shouldn’t larger than a number M.
Saya is very interest in this game. She says that since the number of integers is finite, we can enumerate all the selecting and find the largest sum. Saya calls the largest sum Greatest Number (GN). After reflecting for a while, Saya declares that she found the GN and shows her answer.
Kudo wants to know whether Saya’s answer is the best, so she comes to you for help.
Can you help her to compute the GN?
One day, Kudo invited a very simple game:
GivenN integers, then the players choose no more than four integers from them (can be repeated) and add them together. Finally, the one whose sum is the largest wins the game. It seems very simple, but there is one more condition: the sum shouldn’t larger than a number M.
Saya is very interest in this game. She says that since the number of integers is finite, we can enumerate all the selecting and find the largest sum. Saya calls the largest sum Greatest Number (GN). After reflecting for a while, Saya declares that she found the GN and shows her answer.
Kudo wants to know whether Saya’s answer is the best, so she comes to you for help.
Can you help her to compute the GN?
输入
The input consists of several test cases.
The first line of input in each test case contains two integers N (0<N≤1000) andM(0 1000000000), which represent the number of integers and the upper bound.
Each of the next N lines contains the integers. (Not larger than 1000000000)
The last case is followed by a line containing two zeros.
The first line of input in each test case contains two integers N (0<N≤1000) andM(0 1000000000), which represent the number of integers and the upper bound.
Each of the next N lines contains the integers. (Not larger than 1000000000)
The last case is followed by a line containing two zeros.
输出
For each case, print the case number (1, 2 …) and the GN.
Your output format should imitate the sample output. Print a blank line after each test case.
Your output format should imitate the sample output. Print a blank line after each test case.
示例输入
2 1010020 0
示例输出
Case 1: 8
提示
来源
2010年山东省第一届ACM大学生程序设计竞赛
示例程序
#include<iostream> #include<cstdio> #include<cstring> #include<cmath> #include<algorithm> using namespace std; int str[1000010],op[1010]; int main() { int i,j,k,n,m,ans,t=1; bool flag=false; while(~scanf("%d%d",&n,&m),n||m) { op[0] = k = 0; for(i=1;i<=n;i++) scanf("%d",&op[i]); sort(op,op+n+1); for(i=0;i<=n;i++) for(j=i;j<=n;j++) { if(op[i]+op[j]<=m) str[k++] = op[i]+op[j]; } sort(str,str+k); ans = 0; for(i=0;i<k;i++) { int low=i,high=k-1; while(low<high) { int mid=(low+high)/2; if(str[i]+str[mid]>m) high = mid-1; else low = mid+1; } if(str[i]+str[low]>ans && str[i]+str[low]<=m) ans = str[i]+str[low]; } if(flag) printf("\n"); printf("Case %d: %d\n",t++,ans); flag = true; } return 0; }
0 0
- Greatest Number
- Greatest Number
- Greatest Number
- Greatest Number
- Greatest Number
- Greatest Number
- sdut2157 Greatest Number
- sdibt 2406 Greatest Number (dfs)
- 山东理工Greatest Number 解题报告
- SDUT:2157 Greatest Number(中途相遇法)
- 山东省ACM第一届省赛 Greatest Number
- Greatest Number 山东省第一届ACM程序设计大赛
- 山东省第一届ACM大学生程序设计竞赛--Greatest Number--二分
- 山东省2010年省赛 Greatest Number(巧妙暴力+二分)
- sdnu山东省ACM 2010年第一届省赛Greatest Number
- Greatest Greatest Common Divisor
- [2010山东ACM省赛] Greatest Number(数的组合+二分搜索)
- [2010山东省第一届ACM大学生程序设计竞赛]——Greatest Number
- 设置透明的NavBar 获取纯色图片
- joy of data
- [LeetCode]009-Palindrome Number
- 发布nodejs到npm的简单示例
- Shopping
- Greatest Number
- POJ-2656
- jsonArray 构成的String对象可以上传多条数据
- 基于mini2440的裸机led程序及其链接脚本分析
- javascript常用内置对象
- bzoj 2809(可并堆(斜堆,左偏堆))
- Hello World!
- ios Masonry怎么以纯代码的方式计算cell高度
- screen命令