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 = +;
 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[];
         memset(temp,,sizeof(temp));
         for(int i = ;i < len;++i)
         if(str[i] == 'U') temp[]++;
         else if(str[i] == 'R') temp[]++;
         else if(str[i] == 'D') temp[]++;
         else if(str[i] == 'L') temp[]++;
         else temp[]++;
         printf("%d %d %d %d\n",temp[]-temp[]-temp[],temp[]-temp[]-temp[],temp[]-temp[]+temp[],temp[]-temp[] + temp[]);
     }
     return ;
 }