HNU 12827 NASSA’s Robot

题目链接：http://acm.hnu.cn/online/?action=problem&type=show&id=12827&courseid=268

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int maxn = 100000+5;
char str[maxn];
int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%s",str);
        int x1 = 0x7fffffff,y1 = 0x7fffffff,x2 = -0x7fffffff,y2 = -0x7fffffff;
        int len = strlen(str),temp[5];
        memset(temp,0,sizeof(temp));
        for(int i = 0;i < len;++i)
        if(str[i] == 'U') temp[0]++;
        else if(str[i] == 'R') temp[1]++;
        else if(str[i] == 'D') temp[2]++;
        else if(str[i] == 'L') temp[3]++;
        else temp[4]++;
        printf("%d %d %d %d
",temp[1]-temp[3]-temp[4],temp[0]-temp[2]-temp[4],temp[1]-temp[3]+temp[4],temp[0]-temp[2] + temp[4]);
    }
    return 0;
}