Distributing Ballot Boxes HDU - 4190

问题·：

Today, besides SWERC'11, another important event is taking place in Spain which rivals it in importance: General Elections. Every single resident of the country aged 18 or over is asked to vote in order to choose representatives for the Congress of Deputies and the Senate. You do not need to worry that all judges will suddenly run away from their supervising duties, as voting is not compulsory. 
The administration has a number of ballot boxes, those used in past elections. Unfortunately, the person in charge of the distribution of boxes among cities was dismissed a few months ago due to nancial restraints. As a consequence, the assignment of boxes to cities and the lists of people that must vote in each of them is arguably not the best. Your task is to show how efficiently this task could have been done. 
The only rule in the assignment of ballot boxes to cities is that every city must be assigned at least one box. Each person must vote in the box to which he/she has been previously assigned. Your goal is to obtain a distribution which minimizes the maximum number of people assigned to vote in one box. 
In the first case of the sample input, two boxes go to the fi rst city and the rest to the second, and exactly 100,000 people are assigned to vote in each of the (huge!) boxes in the most efficient distribution. In the second case, 1,2,2 and 1 ballot boxes are assigned to the cities and 1,700 people from the third city will be called to vote in each of the two boxes of their village, making these boxes the most crowded of all in the optimal assignment.

Input

The fi rst line of each test case contains the integers N (1<=N<=500,000), the number of cities, and B(N<=B<=2,000,000), the number of ballot boxes. Each of the following N lines contains an integer a i,(1<=a i<=5,000,000), indicating the population of the i th city. 
A single blank line will be included after each case. The last line of the input will contain -1 -1 and should not be processed.

Output

For each case, your program should output a single integer, the maximum number of people assigned to one box in the most efficient assignment.

Sample Input

2 7
200000
500000

4 6
120
2680
3400
200

-1 -1

Sample Output

100000
1700

大意：

给你城市数目和箱子数，然后是每个城市的投票数，开始进行投票，每个城市最少有一个箱子，问你如何分配才能使投票数目最多的箱子里的票数降到最少（每各城市里的箱子均分票数）。

思路：

采用二分法，逐步求出箱子里最多票数的数目，然后判断箱子数目是否满足条件。

代码：

#define N 5500000
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int k[N];
int n,m;
int main()
{
    while(scanf("%d%d",&n,&m)&&(n!=-1||m!=-1))
    {
        int i,ma=-0x3f3f3f3f;
        for(i=0; i<n; i++)
        {
            scanf("%d",&k[i]);
            if(ma<k[i])
                ma=k[i];//先找出最大值，然后从最大值开始二分法
        }
        if(n==m)
        {
            printf("%d\n",ma);
            continue;
        }
        int a=1,b=ma;
        while(a<b)//二分法找最大票数
        {
            int mid=(a+b)/2,c,sum=0;
            for(int i=0; i<n; i++)//计算以mid为为最大票时，箱子数是否符合要求
            {
                if(k[i]%mid)
                    sum+=k[i]/mid+1;
                else
                    sum+=k[i]/mid;
            }
            if(sum>m)//如果需要的箱子是比总箱子数多，说明最大数偏小了
                a=mid+1;
            else     //不比总箱子数多，可能最大数目还能减小
                b=mid;
        }
        printf("%d\n",b);
    }
    return 0;
}