CF初体验---Round #348，B

B题:
B. Little Artem and Grasshopper
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
Little Artem found a grasshopper. He brought it to his house and constructed a jumping area for him.

The area looks like a strip of cells 1 × n. Each cell contains the direction for the next jump and the length of that jump. Grasshopper starts in the first cell and follows the instructions written on the cells. Grasshopper stops immediately if it jumps out of the strip. Now Artem wants to find out if this will ever happen.

Input
The first line of the input contains a single integer n (1 ≤ n ≤ 100 000) — length of the strip.

Next line contains a string of length n which consists of characters “<” and “>” only, that provide the direction of the jump from the corresponding cell. Next line contains n integers di (1 ≤ di ≤ 109) — the length of the jump from the i-th cell.

Output
Print “INFINITE” (without quotes) if grasshopper will continue his jumps forever. Otherwise print “FINITE” (without quotes).
Examples
input
2

<
1 2
output
FINITE
input
3

<
2 1 1
output
INFINITE
Note
In the first sample grasshopper starts from the first cell and jumps to the right on the next cell. When he is in the second cell he needs to jump two cells left so he will jump out of the strip.

Second sample grasshopper path is 1 - 3 - 2 - 3 - 2 - 3 and so on. The path is infinite.
题意：
有一排格子，每个格子上有方向和数字。方向表示向哪个方向跳，数字表示跳几格。从第一格开始，求最终能不能跳出格子。
题解：我的思路是用string s存方向，数组step[]存步数，将使用过的step[i]=0,如果i<0||i>num-1，则说明跳出，如果遇到step[i]=0,则说明来过，于是就是不会跳出，无穷尽下去
提交错误原因：
没有注意出去的判断条件是i>num-1。。。。注意数组是从0到num-1（如果发现特殊点，自己可以编数据，测试一下）

#include<iostream>
#include<string>
using namespace std;
int main(){
int num;
cin>>num;
string s;
cin>>s;
int step[s.size()];
for(int i=0;i<s.size();i++){cin>>step[i];}
for(int i=0;;){
        if(i<0||i>num-1){
        cout<<"FINITE"<<endl;break;
    }
        if(step[i]==0){
        cout<<"INFINITE"<<endl;break;
        }

    if(s[i]=='>'){//右移动
        int temp;
        temp=i;
        i+=step[i];
        step[temp]=0;continue;
    }
    if(s[i]=='<'){//左移动
         int temp;
        temp=i;
        i-=step[i];
        step[temp]=0;continue;

    }

}
}