zoukankan      html  css  js  c++  java
  • The Frog's Games



    Problem Description
    The annual Games in frogs' kingdom started again. The most famous game is the Ironfrog Triathlon. One test in the Ironfrog Triathlon is jumping. This project requires the frog athletes to jump over the river. The width of the river is L (1<= L <= 1000000000). There are n (0<= n <= 500000) stones lined up in a straight line from one side to the other side of the river. The frogs can only jump through the river, but they can land on the stones. If they fall into the river, they 
    are out. The frogs was asked to jump at most m (1<= m <= n+1) times. Now the frogs want to know if they want to jump across the river, at least what ability should they have. (That is the frog's longest jump distance).
     

    Input
    The input contains several cases. The first line of each case contains three positive integer L, n, and m. 
    Then n lines follow. Each stands for the distance from the starting banks to the nth stone, two stone appear in one place is impossible.
     

    Output
    For each case, output a integer standing for the frog's ability at least they should have.
     

    Sample Input
    6 1 2 2 25 3 3 11 2 18
     

    Sample Output
    4 11
    一只青蛙过河 给出河宽和每个石头的位置 求青蛙最小跳跃力(保证青蛙能够过河 青蛙跳的最远的一次 至少是多少)
    #include<cstdio>
    #include<cmath>
    #include<algorithm>
    using namespace std;	
    int L,n,m;
    int  s[500001];
    int cha(int mid)
    {
    	   int cut=0;
    	   int last=0;
    	for(int i=1;i<=n+1;)
    	{
    	     if(last+mid>=s[i])
    	     {
    	        i++;
    		 }
    		 else
    		 {
    		 	if(last==s[i-1])
    		 	{
    		 			return false;
    			 }
    		 	last=s[i-1];
    	     	cut++;
    		 }
    	}
    	cut++;
    	  return cut<=m;
    }
    int main()
    {
    	while(scanf("%d%d%d",&L,&n,&m)!=EOF)
    	{
    	      for( int i=1;i<=n;i++)
    	      {
    	      	scanf("%d",&s[i]);
    		  } 
    		  sort(s+1,s+n+1);
    		 s[n+1]=L;
     		int  l=0,r=L;
     		int ans;
    		while(l<=r)
    		{
    			int mid=(l+r)/2;
    			if(cha(mid))
    			{
    				ans=mid;
    				r=mid-1;
    			}
    			else
    			{
    				l=mid+1;
    			}
    		}
    		printf("%d
    ",ans);
    	}
    	return 0;
    }


    Problem Description
    The annual Games in frogs' kingdom started again. The most famous game is the Ironfrog Triathlon. One test in the Ironfrog Triathlon is jumping. This project requires the frog athletes to jump over the river. The width of the river is L (1<= L <= 1000000000). There are n (0<= n <= 500000) stones lined up in a straight line from one side to the other side of the river. The frogs can only jump through the river, but they can land on the stones. If they fall into the river, they 
    are out. The frogs was asked to jump at most m (1<= m <= n+1) times. Now the frogs want to know if they want to jump across the river, at least what ability should they have. (That is the frog's longest jump distance).
     

    Input
    The input contains several cases. The first line of each case contains three positive integer L, n, and m. 
    Then n lines follow. Each stands for the distance from the starting banks to the nth stone, two stone appear in one place is impossible.
     

    Output
    For each case, output a integer standing for the frog's ability at least they should have.
     

    Sample Input
    6 1 2 2 25 3 3 11 2 18
     

    Sample Output
    4 11
  • 相关阅读:
    KMP
    C. Three Base Stations
    Calculation 2 [HUD 3501]
    组合数 com(n,r)
    Keep Deleting [zoj 3643]
    LightSwitch V1.0 正式发布,配套控件收集 !
    微软 Lightswitch 学习研讨 QQ群:97010590
    IIS 7开发与管理完全参考手册
    电影 下载 地址收集
    2011年A股中报十大筹码集中王 (收藏)
  • 原文地址:https://www.cnblogs.com/kingjordan/p/12027127.html
Copyright © 2011-2022 走看看