codefoceA--New Year Transportation
来源:互联网 发布:汉语拼音拼读软件 编辑:程序博客网 时间:2024/05/29 13:13
Description
New Year is coming in Line World! In this world, there are n cells numbered by integers from 1 to n, as a 1 × n board. People live in cells. However, it was hard to move between distinct cells, because of the difficulty of escaping the cell. People wanted to meet people who live in other cells.
So, user tncks0121 has made a transportation system to move between these cells, to celebrate the New Year. First, he thought of n - 1positive integers a1, a2, ..., an - 1. For every integer i where 1 ≤ i ≤ n - 1 the condition 1 ≤ ai ≤ n - i holds. Next, he made n - 1portals, numbered by integers from 1 to n - 1. The i-th (1 ≤ i ≤ n - 1) portal connects cell i and cell (i + ai), and one can travel from cell i to cell (i + ai) using the i-th portal. Unfortunately, one cannot use the portal backwards, which means one cannot move from cell(i + ai) to cell i using the i-th portal. It is easy to see that because of condition 1 ≤ ai ≤ n - i one can't leave the Line World using portals.
Currently, I am standing at cell 1, and I want to go to cell t. However, I don't know whether it is possible to go there. Please determine whether I can go to cell t by only using the construted transportation system.
Input
The first line contains two space-separated integers n (3 ≤ n ≤ 3 × 104) and t (2 ≤ t ≤ n) — the number of cells, and the index of the cell which I want to go to.
The second line contains n - 1 space-separated integers a1, a2, ..., an - 1 (1 ≤ ai ≤ n - i). It is guaranteed, that using the given transportation system, one cannot leave the Line World.
Output
If I can go to cell t using the transportation system, print "YES". Otherwise, print "NO".
Sample Input
8 41 2 1 2 1 2 1
YES
8 51 2 1 2 1 1 1
NO
Hint
In the first sample, the visited cells are: 1, 2, 4; so we can successfully visit the cell 4.
In the second sample, the possible cells to visit are: 1, 2, 4, 6, 7, 8; so we can't visit the cell 5, which we want to visit.
输入两个数n,m;
输入n-1个数a[i],m表示想要跳到的位置
i+a[i]表示能跳到的位置,判断是否能跳到目标位置
题解:从开始连跳,在不超出m的范围内,看是否能到达m
code:
- codefoceA--New Year Transportation
- A. New Year Transportation
- New Year Transportation
- A. New Year Transportation
- New Year Transportation
- 【codeforces】New Year Transportation
- New Year Transportation
- Codeforces New Year Transportation
- 500A - New Year Transportation
- 500A. New Year Transportation
- Good Bye 2014--A. New Year Transportation
- coderforce 500A. New Year Transportation
- CodeForces 500A New Year Transportation
- CF 500 A New Year Transportation
- CF - 500A New Year Transportation
- 【暴力】Codeforces-500A New Year Transportation
- codeforces500A New Year Transportation (水题 模拟)
- New Year Transportation(CoderForces A)
- ios修改textField的placeholder的字体颜色和大小
- String.Format的用法
- JavaOne 2016:使JDK更安全
- python函数变量的作用域
- C/C++ volatile
- codefoceA--New Year Transportation
- NS_OPTIONS
- 100款编程在线工具|果断收藏!
- springAOP之framework包的解读(二)
- jetty与tomcat区别
- 二进制
- Spring MVC配置
- arrts
- Python命名空间和作用域窥探