2014北京網路賽1006||hdu5037 思維題
http://acm.hdu.edu.cn/showproblem.php?pid=5037
Problem Description
Once upon a time, there is a little frog called Matt. One day, he came to a river.
The river could be considered as an axis.Matt is standing on the left bank now (at position 0). He wants to cross the river, reach the right bank (at position M). But Matt could only jump for at most L units, for example from 0 to L.
As the God of Nature, you must save this poor frog.There are N rocks lying in the river initially. The size of the rock is negligible. So it can be indicated by a point in the axis. Matt can jump to or from a rock as well as the bank.
You don't want to make the things that easy. So you will put some new rocks into the river such that Matt could jump over the river in maximal steps.And you don't care the number of rocks you add since you are the God.
Note that Matt is so clever that he always choose the optimal way after you put down all the rocks.
The river could be considered as an axis.Matt is standing on the left bank now (at position 0). He wants to cross the river, reach the right bank (at position M). But Matt could only jump for at most L units, for example from 0 to L.
As the God of Nature, you must save this poor frog.There are N rocks lying in the river initially. The size of the rock is negligible. So it can be indicated by a point in the axis. Matt can jump to or from a rock as well as the bank.
You don't want to make the things that easy. So you will put some new rocks into the river such that Matt could jump over the river in maximal steps.And you don't care the number of rocks you add since you are the God.
Note that Matt is so clever that he always choose the optimal way after you put down all the rocks.
Input
The first line contains only one integer T, which indicates the number of test cases.
For each test case, the first line contains N, M, L (0<=N<=2*10^5,1<=M<=10^9, 1<=L<=10^9).
And in the following N lines, each line contains one integer within (0, M) indicating the position of rock.
For each test case, the first line contains N, M, L (0<=N<=2*10^5,1<=M<=10^9, 1<=L<=10^9).
And in the following N lines, each line contains one integer within (0, M) indicating the position of rock.
Output
For each test case, just output one line “Case #x: y", where x is the case number (starting from 1) and y is the maximal number of steps Matt should jump.
Sample Input
2
1 10 5
5
2 10 3
3
6
Sample Output
Case #1: 2
Case #2: 4
我參考:http://blog.csdn.net/u014569598/article/details/39471913
#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
using namespace std;
int n,m,l,a[200005];
int main()
{
int T,tt=0;
scanf("%d",&T);
while(T--)
{
scanf("%d%d%d",&n,&m,&l);
for(int i=1;i<=n;i++)
scanf("%d",&a[i]);
a[0]=0;a[++n]=m;
sort(a,a+n+1);
int k=l;
int ans=0;
for(int i=1;i<=n;i++)
{
int x=(a[i]-a[i-1])%(l+1);
int y=(a[i]-a[i-1])/(1+l);
if(k+x>l)
{
ans+=2*y+1;
k=x;
}
else
{
ans+=2*y;
k+=x;
}
}
printf("Case #%d: %d\n",++tt,ans);
}
return 0;
}
相關文章
- 2014西安網路賽1006||hdu5012 bfs
- 2014年北京師範大學新生程式設計競賽網路賽程式設計
- 威馬汽車閆楓:造車新賽道的網際網路思維
- 啥叫網際網路思維
- 2014北京網路賽1007||hdu5038 模擬
- 網際網路公司,網際網路時代的特徵(移動網際網路,平臺思維,網際網路思維)特徵
- 2013成都網路賽1004題HDU 4731Minimum palindrome (思維題目)
- 28張圖清楚“網際網路思維”
- 網際網路思維 傲慢的鬧劇
- 2014鞍山網路賽 E題||hdu 5001 概率dp
- 挑選方案問題(牛客競賽 思維題+推導公式)公式
- 周朝陽:我眼中的網際網路思維
- 當圖靈社群遇上“網際網路思維”圖靈
- 網際網路思維的六大特性
- 用網際網路思維改造企業文化
- 藍思維網路營銷交流平臺
- 中國電影有病,網際網路思維沒藥
- ACM-ICPC 2018 南京賽區網路預賽__J. Sum【尤拉篩法+質因子分解+思維】ACM
- 冷思考:從“網際網路思維”說起網際網路迷局
- hihocoder 1232 || 2015北京網路賽F題 樹連剖分
- 北京拓爾思公司的"網路輿情監控系統"
- 如何用寫小說的思維做網路安全?
- 周鴻禕:網際網路思維不是”萬能藥”
- 網際網路思維的企業——滾雪球效應
- 網際網路思維引發的集體魔症
- 12306的網際網路思維——資訊圖
- 【怒贊】史上最全的網際網路思維精髓總結
- 成功運用網際網路思維的10個本土案例
- 用網際網路思維做產品的7個要素
- “網際網路思維”的實質思考,源於毛澤東思想?
- [北京] 學而思網校招聘PHP實習生PHP
- 思維體系---技術思維、業務資料思維、產品思維、複合思維
- 計網複習筆記【附思維導圖】——【4】網路層筆記
- 擺脫IT思維,工業網際網路才能走深向實
- 網際網路思維是常識的迴歸——周鴻禕
- 為什麼“網際網路思維”已經徹底out了?
- #慧分享#《網際網路思維-獨孤九劍》讀書筆記總結篇--9大思維,22條法則筆記
- 網路思維對科學的革命性改變