山东省ACM第一届省赛 Greatest Number

Greatest Number

题目：

Saya likes math, because she think math can make her cleverer.

One day, Kudo invited a very simple game:

Given N 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?

input

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<M≤ 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.

Output

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.

Sample Input

2 10

100

2

题目大意：给定一些数和一个边界值，用这些数，进行小于4（可以重复使用某一值）的组合，找最近接边界的值。

这个题的关键在于数据进行组合后数据量太大，遍历会超时，而且数组存不下。所以考虑降低无用数据的检测，并且因为是小于四个的组合，可分解成先组合成一个的，再两个进行组合。将这个数组进行排序，，在使用二分法进行搜索。

#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
long long a[1000010];
bool cmp(longlong a,longlong b)
{
    return a<b;
}
int main()
{
    int n,jishu=0;
    long long bianjie,t,b,k;
    while(1)
    {
            t=0;
            scanf("%d%lld",&n,&bianjie);
            if(n==0&&bianjie==0)
            {
                    return 0;
            }
            for(int i=1;i<=n;++i)
            {
                scanf("%lld",&b);
                if(b<=bianjie)
                { a[++t]=b;
                }
            }
            a[0]=0;//将a[0]存为0，目的是在后面的遍历中进行“一个”的组合。
            k=t;
            for(int i=1;i<=k;++i)
            {
                for(int j=i;j<=k;++j)
                {
                    a[++t]=a[i]+a[j];
                }
            }


            sort(a,a+t,cmp);


            long long ans=0;
            int flag=0;
            for(int i=0;i<=t;++i)
            {
                long long left,right,mid,temp;
                left=i; right=t;
                while(left<=right)
                {
                    mid=(left+right)/2; temp=a[i]+a[mid];
                    if(temp>bianjie)
                    {
                        right=mid-1;
                    }
                    if(temp==bianjie)
                    {
                        ans=temp;
                        flag=1;
                        break;
                    }
                    if(temp<=bianjie)
                    {
                        if(temp>ans)
                        {
                            ans=temp;//每次二分寻找最大的接近值，所有次遍历之后就是结果。
                        }
                        left=mid+1;
                    }
                }
                if(flag==1)
                {
                    break;
                }
            }
            printf("Case %d: %lld\n\n",++jishu,ans);
    }
    return 0;
}

总结：本题用下标二分，寻找一个区间中的某个特定值，用二分可以降低循环次数。

二分思想用于在有序状态下某一特定值的寻找。