文章标题 CoderForces 298B : Sail（分类）

Sail

Description
The polar bears are going fishing. They plan to sail from (sx, sy) to (ex, ey). However, the boat can only sail by wind. At each second, the wind blows in one of these directions: east, south, west or north. Assume the boat is currently at (x, y).
If the wind blows to the east, the boat will move to (x + 1, y).
If the wind blows to the south, the boat will move to (x, y - 1).
If the wind blows to the west, the boat will move to (x - 1, y).
If the wind blows to the north, the boat will move to (x, y + 1).
Alternatively, they can hold the boat by the anchor. In this case, the boat stays at (x, y). Given the wind direction for t seconds, what is the earliest time they sail to (ex, ey)?
Input
The first line contains five integers t, sx, sy, ex, ey (1 ≤ t ≤ 105,  - 109 ≤ sx, sy, ex, ey ≤ 109). The starting location and the ending location will be different.
The second line contains t characters, the i-th character is the wind blowing direction at the i-th second. It will be one of the four possibilities: “E” (east), “S” (south), “W” (west) and “N” (north).
Output
If they can reach (ex, ey) within t seconds, print the earliest time they can achieve it. Otherwise, print “-1” (without quotes).
Sample Input
Input
5 0 0 1 1
SESNW
Output
4
Input
10 5 3 3 6
NENSWESNEE
Output
-1
Hint
In the first sample, they can stay at seconds 1, 3, and move at seconds 2, 4.
In the second sample, they cannot sail to the destination.
题意:有一只船想从（x1,y1）到（x2,y2），但船只能通过风移动，它能随船移动一个位置也能保持原地不动。
分析：从起始点到重点，必须要从左右中选择一个方向，从上下中选择一个方向，这样就总共有四种情况，然后从序列中找fabs(x2-x1)和fabs(y2-y1)的字符就行了
代码：

#include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<math.h>
#include<map>
#include<queue> 
#include<algorithm>
using namespace std;
const int inf = 0x3f3f3f3f;
int t;
int s1,e1,s2,e2;
int main ()
{
    string a;
    while (scanf ("%d",&t)!=EOF){
        scanf ("%d%d%d%d",&s1,&e1,&s2,&e2);
            cin>>a;
            int len = a.length();
            long long  x=s2-s1,y=e2-e1;
            int cnt1=0,cnt2=0;
            int flag=0;
            int place=0;
            if(x>=0&&y>=0){
//第一种情况
                for (int i=0;i<len;i++){

                    if (a[i]=='E'){
                        cnt1++;
                    }
                    if (a[i]=='N'){
                        cnt2++;
                    }
                    if (cnt1>=fabs(x)&&cnt2>=fabs(y)){
                        flag=1;
                        place=i+1;
                        break;
                    }
                }
            }
            else if(x<=0&&y>=0){
//第二种情况
                for (int i=0;i<len;i++){
                    if (a[i]=='W'){
                        cnt1++;
                    }
                    if (a[i]=='N'){
                        cnt2++;
                    }
                    if (cnt1>=fabs(x)&&cnt2>=fabs(y)){
                        flag=1;
                        place=i+1;
                        break;
                    }
                }
            }
            else if(x<=0&&y<=0){
//第三种情况
                for (int i=0;i<len;i++){

                    if (a[i]=='W'){
                        cnt1++;
                    }
                    if (a[i]=='S'){
                        cnt2++;
                    }
                    if (cnt1>=fabs(x)&&cnt2>=fabs(y)){
                        flag=1;
                        place=i+1;
                        break;
                    }
                }
            }
            else if(x>=0&&y<=0){
//第四种情况
                for (int i=0;i<len;i++){

                    if (a[i]=='E'){
                        cnt1++;
                    }
                    if (a[i]=='S'){
                        cnt2++;
                    }
                    if (cnt1>=fabs(x)&&cnt2>=fabs(y)){
                        flag=1;
                        place=i+1;
                        break;
                    }
                }
            }
        if (flag){
            printf ("%d\n",place);
        }
        else printf ("-1\n");
    }
    return 0;
}