zoukankan      html  css  js  c++  java
  • 2017 ACM/ICPC 沈阳 K题 Rabbits

    Here N (N ≥ 3) rabbits are playing by the river. They are playing on a number line, each occupying a different integer. In a single move, one of the outer rabbits jumps into a space between any other two. At no point may two rabbits occupy the same position. 
    Help them play as long as possible

    InputThe input has several test cases. The first line of input contains an integer t (1 ≤ t ≤ 500) indicating the number of test cases. 
    For each case the first line contains the integer N (3 ≤ N ≤ 500) described as above. The second line contains n integers a1a1 < a2a2 < a3a3 < ... < aNaN which are the initial positions of the rabbits. For each rabbit, its initial position 
    aiai satisfies 1 ≤ aiai ≤ 10000. 
    OutputFor each case, output the largest number of moves the rabbits can make. 
    Sample Input

    5
    3
    3 4 6
    3
    2 3 5
    3
    3 5 9
    4
    1 2 3 4
    4
    1 2 4 5

    Sample Output

    1
    1
    3
    0
    1
    签到题:Orz
     1 #include<bits/stdc++.h>
     2 using namespace std;
     3 int T,num[510],sum[510];
     4 int main()
     5 {
     6     scanf("%d",&T);
     7     while(T--)
     8     {
     9         int n;
    10         scanf("%d",&n);
    11         int len=0;
    12         for(int i=1;i<=n;i++) scanf("%d",&num[i]);
    13         for(int i=1;i<n;i++) sum[i]=num[i+1]-num[i]-1,len+=sum[i];
    14         int ans=len-min(sum[1],sum[n-1]);
    15         printf("%d
    ",ans);
    16     }
    17     return 0;
    18 }
    View Code

      

  • 相关阅读:
    TSQL--NESTED LOOPS JOIN
    TSQL--SORT MERGE JOIN
    TSQL--HASH JOIN
    Backup--备份相关的信息查看及小技巧
    java后台json如何传递到jsp中解析
    大数据资源
    oracle sql生成日历表
    easyUI中onLoadSuccess方法获取多个对象
    征信用户数据分析
    JS优秀资源站点收集
  • 原文地址:https://www.cnblogs.com/csushl/p/9784969.html
Copyright © 2011-2022 走看看