poj1064二分搜索
来源:互联网 发布:c语言 逆波兰式计算器 编辑:程序博客网 时间:2024/04/30 21:51
如题:http://poj.org/problem?id=1064
Cable master
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 25713 Accepted: 5528
Description
Inhabitants of the Wonderland have decided to hold a regional programming contest. The Judging Committee has volunteered and has promised to organize the most honest contest ever. It was decided to connect computers for the contestants using a "star" topology - i.e. connect them all to a single central hub. To organize a truly honest contest, the Head of the Judging Committee has decreed to place all contestants evenly around the hub on an equal distance from it.
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.
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
The first line of the input file contains two integer numb ers N and K, separated by a space. N (1 = N = 10000) is the number of cables in the stock, and K (1 = K = 10000) is the number of requested pieces. The first line is followed by N lines with one number per line, that specify the length of each cable in the stock in meters. All cables are at least 1 meter and at most 100 kilometers in length. All lengths in the input file are written with a centimeter precision, with exactly two digits after a decimal point.
Output
Write to the output file the maximal length (in meters) of the pieces that Cable Master may cut from the cables in the stock to get the requested number of pieces. The number must be written with a centimeter precision, with exactly two digits after a decimal point.
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).
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 118.027.434.575.39
Sample Output
2.00
Source
Northeastern Europe 2001
题目大意:意思很简单,给出N个绳子和他们的长度,要求切成K个长度一致的绳子,问满足条件的最大长度能是多少
思路:二分搜索,初始左端点0,右端点绳子的总长,最终找到满足条件的,注意精度的把我很重要,通过循环次数100次来使范围足够小。
#include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
double L[10005];
int N,K;
int C(double x)
{
int num=0;
int i;
for(i=1;i<=N;i++)
num+=(int)(L[i]/x);
return num>=K;
}
int main()
{
//freopen("C:\\1.txt","r",stdin);
cin>>N>>K;
int i;
double rb=0;
double lb=0;
for(i=1;i<=N;i++)
{
scanf("%lf",&L[i]);
rb+=L[i];
}
for(i=0;i<100;i++)
{
double mid=(lb+rb)/2;
if(C(mid))
lb=mid;
else
rb=mid;
}
printf("%.2f\n",(floor)(lb*100)/100);
}
0 0
- 二分搜索--poj1064
- poj1064二分搜索
- poj1064 二分搜索
- poj1064(二分搜索)
- poj1064二分搜索的应用
- Cable master poj1064(二分搜索)
- POJ1064 Cable master(二分搜索)
- poj1064 Cable master(二分搜索)
- Poj1064:二分搜索+可行性判定问题
- POJ1064 二分
- POJ1064二分
- 【POJ1064】二分
- poj1064(二分)
- poj1064(贪心+浮点二分)
- POJ1064 Cable master(二分)
- POJ1064 Cable master 二分
- POJ1064 Cable master 二分
- POJ1064 Cable master(二分)
- 神云科技面试题
- Java 向上转型和向下转型
- 汉字学习
- Eclipse中搭建ssh框架
- C++进阶 必读书籍
- poj1064二分搜索
- ANT打包apk时出现乱码解决方案
- 不同内核浏览器的差异以及浏览器渲染简介
- CP
- g++基本用法
- 如何给你的Android 安装文件(APK)瘦身
- 用godaddy的自助工具建网站的简易方法和常见问题解决
- IIS 内部运行机制
- C inline