2017 ACM/ICPC 沈阳 K题 Rabbits

Posted songorz

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了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
#include<bits/stdc++.h>
using namespace std;
int T,num[510],sum[510];
int main()
{
    scanf("%d",&T);
    while(T--)
    {
        int n;
        scanf("%d",&n);
        int len=0;
        for(int i=1;i<=n;i++) scanf("%d",&num[i]);
        for(int i=1;i<n;i++) sum[i]=num[i+1]-num[i]-1,len+=sum[i];
        int ans=len-min(sum[1],sum[n-1]);
        printf("%d
",ans);
    }
    return 0;
}

  







以上是关于2017 ACM/ICPC 沈阳 K题 Rabbits的主要内容,如果未能解决你的问题,请参考以下文章

2017 ACM/ICPC 沈阳 I题 Little Boxes

2017 ACM/ICPC 沈阳 G题 Infinite Fraction Path

2017 ACM/ICPC 沈阳 F题 Heron and his triangle

2017 acm icpc 沈阳(网络赛)5/12 题解

2017ACM/ICPC亚洲区沈阳站-重现赛(感谢东北大学)HDU6225.Little Boxes-大数加法

2016ACM/ICPC亚洲区沈阳站