Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 46685 | Accepted: 9955 |
Description
To buy network cables, the Judging Committee has contacted a local network solutions provider with a request to sell for them a specified number of cables with equal lengths. The Judging Committee wants the cables to be as long as possible to sit contestants as far from each other as possible.
The Cable Master of the company was assigned to the task. He knows the length of each cable in the stock up to a centimeter,and he can cut them with a centimeter precision being told the length of the pieces he must cut. However, this time, the length is not known and the Cable Master is completely puzzled.
You are to help the Cable Master, by writing a program that will determine the maximal possible length of a cable piece that can be cut from the cables in the stock, to get the specified number of pieces.
Input
Output
If it is not possible to cut the requested number of pieces each one being at least one centimeter long, then the output file must contain the single number "0.00" (without quotes).
Sample Input
4 11 8.02 7.43 4.57 5.39
Sample Output
2.00
Source
個人理解:二分法枚舉所有可能出現的長度,將該長度分成多於或等於若干份,從中選取最大長度,裏面運用了c++算法,從而得到該長度,還有注意對精度的設定,以及c++中一些頭文件的使用。
結果 | 語言 | 時間 | 內存 |
Accepted | c++ | 94Ms | 272K |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn=10000+10;
int n,m;
int a[maxn],maxa;
void solve()
{
int L=0,R=maxa+1,mid;
int ans=0;
while(L+1<R){
ans=0;
mid=(L+R)/2;
for(int i=0;i<n;i++)
ans+=a[i]/mid;
if(ans<m)R=mid;
else L=mid;
}
printf("%.2lf\n",L/100.00);
}
int main()
{
cin>>n>>m;
maxa=0;
double t;
for(int i=0;i<n;i++){
scanf("%lf",&t);
a[i]=t*100;
maxa=max(maxa,a[i]);
}
solve();
return 0;
}