POJ 3258 River Hopscotch(二分)
来源:互联网 发布:打印证件照片软件 编辑:程序博客网 时间:2024/05/10 12:44
Description
Every year the cows hold an event featuring a peculiar version of hopscotch that involves carefully jumping from rock to rock in a river. The excitement takes place on a long, straight river with a rock at the start and another rock at the end, L units away from the start (1 ≤ L ≤ 1,000,000,000). Along the river between the starting and ending rocks, N (0 ≤ N ≤ 50,000) more rocks appear, each at an integral distance Di from the start (0 < Di < L).
To play the game, each cow in turn starts at the starting rock and tries to reach the finish at the ending rock, jumping only from rock to rock. Of course, less agile cows never make it to the final rock, ending up instead in the river.
Farmer John is proud of his cows and watches this event each year. But as time goes by, he tires of watching the timid cows of the other farmers limp across the short distances between rocks placed too closely together. He plans to remove several rocks in order to increase the shortest distance a cow will have to jump to reach the end. He knows he cannot remove the starting and ending rocks, but he calculates that he has enough resources to remove up to M rocks (0 ≤ M ≤ N).
FJ wants to know exactly how much he can increase the shortest distance *before* he starts removing the rocks. Help Farmer John determine the greatest possible shortest distance a cow has to jump after removing the optimal set of M rocks.
Input
Lines 2..N+1: Each line contains a single integer indicating how far some rock is away from the starting rock. No two rocks share the same position.
Output
Sample Input
25 5 2214112117
Sample Output
4
Hint
Source
#include<iostream>#include<algorithm>#include<stdio.h>#include<string.h>#include<stdlib.h>using namespace std;int n,m,k;int num[100010];int main(){ while(scanf("%d%d%d",&n,&m,&k)!=EOF) { num[0] = 0; num[m+1] = n; for(int i=1;i<=m;i++) { scanf("%d",&num[i]); } int l = 0; int r = n; int mid; sort(num,num+m+2); int sum = 0; while(l<r) { int ans = 0; sum = 0; mid = (l+r)/2; for(int i=1;i<=m+1;i++) { if((sum+num[i]-num[i-1])<=mid) { sum += num[i] - num[i-1]; ans++; } else { sum = 0; } } if(ans<=k) { l = mid + 1; } else { r = mid; } } printf("%d\n",l); } return 0;}
- poj 3258 River Hopscotch(二分答案)
- poj 3258 River Hopscotch(二分搜索)
- POJ 3258 River Hopscotch (二分)
- poj 3258 River Hopscotch(二分+贪心)
- POJ 3258 River Hopscotch(二分 跳河)
- POJ 3258 River Hopscotch (二分搜索)
- POJ 3258 River Hopscotch(二分)
- POJ 3258 River Hopscotch(二分)
- poj-3258 River Hopscotch (二分)
- POJ 3258 River Hopscotch (二分经典)
- POJ 3258-River Hopscotch(二分+贪心)
- 【POJ】3258 - River Hopscotch(二分)
- POJ 3258River Hopscotch(二分计算)
- POJ 3258 River Hopscotch(二分)
- poj 3258 River Hopscotch(二分)
- POJ 3258River Hopscotch(二分)
- poj 3258 River Hopscotch(二分搜索)
- POJ-3258-River Hopscotch(二分+贪心)
- java 用 _id 查找 MongoDB 下的数据
- 在caffe上跑自己的数据
- 怎么在CSDN博客文章中添加公式
- ProgressDialog使用总结
- 每天一个Linux命令-9(Find–atime –ctime –mtime)
- POJ 3258 River Hopscotch(二分)
- Codeforces Round #261 (Div. 2) D. Pashmak and Parmida's problem
- java 解析mp3信息-jid3lib
- 教你如何解包、打包boot.img以及获取adb root权限
- myeclipse 2015 安装 aptana3.6
- [黑马程序员](第16-22天)IO流(上)
- 设计模式_观察者模式
- [黑马程序员](第16-22天)IO流(中)
- 写字台自带跑步机功能_理念不错