hud 6227 Rabbits
来源:互联网 发布:js按钮点击弹出图片 编辑:程序博客网 时间:2024/05/18 03:57
Rabbits
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 439 Accepted Submission(s): 256
Problem Description
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
Help them play as long as possible
Input
The 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 integersa1 < a2 < a3 < ... < aN which are the initial positions of the rabbits. For each rabbit, its initial position
ai satisfies 1 ≤ ai ≤ 10000.
For each case the first line contains the integer N (3 ≤ N ≤ 500) described as above. The second line contains n integers
Output
For each case, output the largest number of moves the rabbits can make.
Sample Input
533 4 632 3 533 5 941 2 3 441 2 4 5
Sample Output
11301
Source
2017ACM/ICPC亚洲区沈阳站-重现赛(感谢东北大学)
Recommend
jiangzijing2015 | We have carefully selected several similar problems for you: 6229 6228 6227 6226 6225
代码:
#include<iostream>#include<algorithm>using namespace std;int main(){ int t,n,a[510],b[510],x; cin>>t; while(t--) { int sum=0; cin>>n; for(int i=0;i<n;i++) cin>>a[i]; for(int i=0;i<n-1;i++) { b[i]=a[i+1]-a[i]-1; sum+=b[i]; } x=min(b[0],b[n-2]); cout<<sum-x<<endl; } return 0;}
如: 1 2 3 4 5 6 7 8 9 10 11
1->(3,11):2+4=6;
11->(1,6):1+2=3;
不能取3和6!!!
阅读全文
0 0
- hud 6227 Rabbits
- HUD 4745 Two Rabbits (区间DP)
- hdu 6227 Rabbits
- Hdu 6227 Rabbits
- Rabbits —— HDU-6227
- HUD
- 【HDU 6227 2017ACM/ICPC亚洲区沈阳站】Rabbits
- Running Rabbits
- HDU6227 ---Rabbits
- The quality of Rabbits
- hdu 4452 Running Rabbits
- hdu 4452 Running Rabbits
- HDU Running Rabbits(模拟)
- hdu 4452 Running Rabbits
- hdu - 4452 - Running Rabbits
- Sicily 1029 Rabbits
- sicily 1029 Rabbits
- HDU4745 Two Rabbits
- OpenCV3图像处理--imread、imwrite、clone
- 【LuaJIT版】从零开始在 macOS 上配置 Lua 开发环境
- 5.2.7 位置方法
- 查询任意汉字的Unicode编码,UTF8编码,GB2312编码,GBK编码
- win驱动kmdf和umdf区别
- hud 6227 Rabbits
- EXT4文件系统的磁盘布局
- 一道恶心的题目,必须严格按照要求
- JSP页面向action传值方式总结
- 尝试WebMagic+Dubbo搭建爬虫Cluster(更新完毕)
- 利用keepalived实现nginx和php-fpm 两台服务器中的服务互为主从
- Java本地接口(JNI)编程规范与指南译文和练习
- 桶排序模板 C++实现
- SDL系列讲解(十) 按键处理流程