【CF】--Buggy Robot （思维）

Buggy Robot
Ivan has a robot which is situated on an infinite grid. Initially the robot is standing in the starting cell (0, 0). The robot can process commands. There are four types of commands it can perform:

U — move from the cell (x, y) to (x, y + 1);
D — move from (x, y) to (x, y - 1);
L — move from (x, y) to (x - 1, y);
R — move from (x, y) to (x + 1, y).
Ivan entered a sequence of n commands, and the robot processed it. After this sequence the robot ended up in the starting cell (0, 0), but Ivan doubts that the sequence is such that after performing it correctly the robot ends up in the same cell. He thinks that some commands were ignored by robot. To acknowledge whether the robot is severely bugged, he needs to calculate the maximum possible number of commands that were performed correctly. Help Ivan to do the calculations!

Input
The first line contains one number n — the length of sequence of commands entered by Ivan (1 ≤ n ≤ 100).

The second line contains the sequence itself — a string consisting of n characters. Each character can be U, D, L or R.

Output
Print the maximum possible number of commands from the sequence the robot could perform to end up in the starting cell.

Example
Input
4
LDUR
Output
4
Input
5
RRRUU
Output
0
Input
6
LLRRRR
Output
4
思路：
机器人向四个方向移动，最后回到初始位置。
左右移动和上下移动是两个分开的过程，左右移动能再回到起点，最多移动的次数是向左移动和向右移动次数之间较小者的2倍，上下移动也是呢。

代码如下：

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        int a[4];
        memset(a,0,sizeof(a));
        char ch;
        int num=0;
        getchar();
        while(n--)
        {
            scanf("%c",&ch);
            if(ch=='L')
                a[0]++;
            else if(ch=='R')
                a[1]++;
            else if(ch=='U')
                a[2]++;
            else if(ch=='D')
                a[3]++;
        }
        num=min(a[0],a[1])*2+min(a[2],a[3])*2;
        printf("%d\n",num);
    }   
    return 0;
}