POJ 3258 River Hopscotch
来源:互联网 发布:宇宙大小的相关数据 编辑:程序博客网 时间:2024/04/25 15:28
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 distanceDi 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 toM 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 ofM 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 <stdio.h>#include <string.h>#include <math.h>int a[50010],b[50010],l,r,n,m,g,flag;int cmp(const void *e, const void *f){ return (*(int *)e-*(int *)f);}int main(){ int binary_search(); int i,j,s,t; while(scanf("%d %d %d",&n,&m,&g)!=EOF) { a[0]=0; for(i=1;i<=m;i++) { scanf("%d",&a[i]); } a[m+1]=n; qsort(a,m+2,sizeof(a[0]),cmp); r=l=n; for(i=1;i<=m+1;i++) { if(a[i]-a[i-1]<l) { l=a[i]-a[i-1]; } } t=binary_search(); printf("%d\n",t); } return 0;}int check(int mid){ int i,j,s; b[0]=a[0]; for(i=1,j=1,s=0;i<=m;i++) { if(a[i]-b[j-1]>=mid) { b[j++]=a[i]; }else { s++; } } for(i=j-1;i>=0;i--) { if((a[m+1]-b[i])<mid) { s++; } } flag++; if(s>g) { return 0; }else { return 1; }}int binary_search(){ int mid,t,res=-1; flag=0; while(l<r) { mid=(l+r)/2; flag++; t=check(mid); if(!t) { r=mid-1; }else { l=mid+1; if(res<mid) { res=mid; } } } t=check(l); if(t==1&&res<l) { res=l; } return res;}
- 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 3258 River Hopscotch
- poj 3258-River Hopscotch
- POJ 3258 River Hopscotch
- POJ 3258 River Hopscotch
- POJ 3258--River Hopscotch
- poj 3258 River Hopscotch
- map用法
- Mysql5.6特性之细解--- DDL online operate
- 数字图像处理3---图像基本运算--续
- JBPM学习(一)--与SSH整合
- Twisted requires zope.interface
- POJ 3258 River Hopscotch
- POI在Excel中插入图片
- 一行代码实现在线编辑器
- android中openMax的实现
- Android ramdisk.img system.img userdata.img
- adb 常用命令大全
- SAP SMARTFORMS 打印 CNSAPWIN 不支持页格式
- ThreadLocal实现方式&使用介绍---无锁化线程封闭
- EXTJS中的store获取额外的值