HDU 7108 Command Sequence

Problem Description

There is a robot that can move by receiving a sequence of commands.

There are four types of command in the command sequence:
 

• 
  
• U: robot moves one unit up.
  
• D: robot moves one unit down.
  
• L: robot moves one unit left.
  
• R: robot moves one unit right.
  
   

Now, given a command sequence of length n. You need to find out how many substrings of the command sequence satisfy that if the robot execute the substring command, it can return to the starting position.

A substring is a contiguous sequence of characters within a string. For instance, "the best of" is a substring of "It was the best of times". For example, "Itwastimes" is a subsequence of "It was the best of times", but not a substring.

 

Input

This problem contains multiple test cases.

The first line contains an integer t (1≤t≤20) indicating the number of test cases.

For each test case, the first line contains one integer n (2≤n≤105).

The second line contains a UDLR string of length n.

 

Output

For each test case, output one line one integer indicating the answer.

 

Sample Input

1 6 URLLDR

 

Sample Output

2

 题意：给定一个命令序列，分别控制机器人向上下左右四个方向移动，求有多少个命令序列的子序列可以使机器人回到原点

思路：可以发现要使机器人回到原点必须要使上下和左右的移动次数相等，可以利用前缀和求出每一步的前缀和，而后通过判断和是否相等来判断机器人是否会回到原点

AC代码：

#include<iostream>
#include<cstring>
#include<cstdio>
#include<map>
using namespace std;

#define ll long long
const int N=100010;

ll sum[N];
string s;
map<char,int> mp={{'U',1},{'D',-1},{'L',N},{'R',-N}};

int main()
{
	int t;
	cin>>t;
	while(t--)
	{
		map<ll,int> a;
		int n;
		cin>>n>>s;
		a[0]=1;
		ll res=0;
		
		for(int i=0;i<n;i++)
		{
			sum[i]=sum[i-1]+mp[s[i]];
			if(a[sum[i]])
				res+=a[sum[i]];
			a[sum[i]]++;
		}
		cout<<res<<endl;
	}
}