2017 ACM/ICPC 沈阳 K题 Rabbits

标签：http   www   math   any   move   turn   cond   sum   class   

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\n",ans);
    }
    return 0;
}

2017 ACM/ICPC 沈阳 K题 Rabbits

标签：http   www   math   any   move   turn   cond   sum   class   

原文地址：https://www.cnblogs.com/songorz/p/9784969.html