zoukankan      html  css  js  c++  java
  • POj1852--Ants

    Ants
    Time Limit: 1000MS   Memory Limit: 30000K
    Total Submissions: 14939   Accepted: 6492

    Description

    An army of ants walk on a horizontal pole of length l cm, each with a constant speed of 1 cm/s. When a walking ant reaches an end of the pole, it immediatelly falls off it. When two ants meet they turn back and start walking in opposite directions. We know the original positions of ants on the pole, unfortunately, we do not know the directions in which the ants are walking. Your task is to compute the earliest and the latest possible times needed for all ants to fall off the pole.

    Input

    The first line of input contains one integer giving the number of cases that follow. The data for each case start with two integer numbers: the length of the pole (in cm) and n, the number of ants residing on the pole. These two numbers are followed by n integers giving the position of each ant on the pole as the distance measured from the left end of the pole, in no particular order. All input integers are not bigger than 1000000 and they are separated by whitespace.

    Output

    For each case of input, output two numbers separated by a single space. The first number is the earliest possible time when all ants fall off the pole (if the directions of their walks are chosen appropriately) and the second number is the latest possible such time. 

    Sample Input

    2
    10 3
    2 6 7
    214 7
    11 12 7 13 176 23 191
    

    Sample Output

    4 8
    

    38 207

    解题思路:

    两只蚂蚁相遇后背道而驰和继续原来的方向是没有差别的,可以画一个图来看。好像BC上出国一道类似的题目。

    源代码:

    <span style="font-size:18px;">#include<iostream>
    #include<cstdio>
    #include<cstring>
    #include<string>
    #include<stack>
    #include<queue>
    #include<vector>
    #include<deque>
    #include<map>
    #include<set>
    #include<algorithm>
    #include<string>
    #include<iomanip>
    #include<cstdlib>
    #include<cmath>
    #include<sstream>
    #include<ctime>
    using namespace std;
    
    typedef long long ll;
    
    int location[1000005];
    
    int main()
    {
        int t;
        int n,m;
        int i,j;
        int MinTime;
        int MaxTime;
        scanf("%d",&t);
        while(t--)
        {
            scanf("%d%d",&n,&m);
            for(i = 0;i < m; i++)
                scanf("%d",&location[i]);
            MinTime = -1;
            MaxTime = -1;
            for(i = 0; i < m; i++)
            {
                MinTime = max(MinTime,min(location[i],n - location[i]));
            }
            for(j = 0; j < m; j++)
            {
                MaxTime = max(MaxTime,max(location[j],n - location[j]));
            }
            printf("%d %d
    ",MinTime,MaxTime);
        }
    	return 0;
    }
    </span>


  • 相关阅读:
    Android-自定义meta-data扩展数据
    (转载)【Android】ViewGroup全面分析
    小问题记录
    Gson使用 .Net中的日期序列化成带字母T的格式,Gson发序列化问题
    Android中自定义textview可以进行自体设置
    .Net版的BeanUtils
    Ksoap2-android 添加网络超时的实现
    Html5 viewport 解释
    计算两个日期之间相差的月数
    Android中的Adapter内,有getView方法
  • 原文地址:https://www.cnblogs.com/lemonbiscuit/p/7776099.html
Copyright © 2011-2022 走看看