【寒假CodeForces】C. Yet Another Walking Robot 题解【奇妙的记录方式
欢迎收藏个人博客：【寒假CodeForces】C. Yet Another Walking Robot 题解【奇妙的记录方式
题目链接：C. Yet Another Walking Robot
题目
There is a robot on a coordinate plane. Initially, the robot is located at the point (0,0). Its path is described as a string s of length n consisting of characters ‘L’, ‘R’, ‘U’, ‘D’.
Each of these characters corresponds to some move:
- ‘L’ (left): means that the robot moves from the point (x,y) to the point (x−1,y);
- ‘R’ (right): means that the robot moves from the point (x,y) to the point (x+1,y);
- ‘U’ (up): means that the robot moves from the point (x,y) to the point (x,y+1);
- ‘D’ (down): means that the robot moves from the point (x,y) to the point (x,y−1).
The company that created this robot asked you to optimize the path of the robot somehow. To do this, you can remove any non-empty substring of the path. But this company doesn’t want their customers to notice the change in the robot behavior. It means that if before the optimization the robot ended its path at the point (xe,ye), then after optimization (i.e. removing some single substring from s) the robot also ends its path at the point (xe,ye).
This optimization is a low-budget project so you need to remove the shortest possible non-empty substring to optimize the robot’s path such that the endpoint of his path doesn’t change. It is possible that you can’t optimize the path. Also, it is possible that after the optimization the target path is an empty string (i.e. deleted substring is the whole string s).
Recall that the substring of s is such string that can be obtained from s by removing some amount of characters (possibly, zero) from the prefix and some amount of characters (possibly, zero) from the suffix. For example, the substrings of “LURLLR” are “LU”, “LR”, “LURLLR”, “URL”, but not “RR” and “UL”.
You have to answer t independent test cases.
输入
The first line of the input contains one integer t (1≤t≤1000) — the number of test cases.
The next 2t lines describe test cases. Each test case is given on two lines. The first line of the test case contains one integer n (1≤n≤2⋅10^5) — the length of the robot’s path. The second line of the test case contains one string s consisting of n characters ‘L’, ‘R’, ‘U’, ‘D’ — the robot’s path.
It is guaranteed that the sum of n over all test cases does not exceed 2⋅10^5 (∑n≤2⋅10^5).
输出
For each test case, print the answer on it. If you cannot remove such non-empty substring that the endpoint of the robot’s path doesn’t change, print -1. Otherwise, print two integers l and r such that 1≤l≤r≤n — endpoints of the substring you remove. The value r−l+1 should be minimum possible. If there are several answers, print any of them.
样例输入
4
4
LRUD
4
LURD
5
RRUDU
5
LLDDR
样例输出
1 2
1 4
3 4
-1
题意
给你一个字符串，表示命令机器人上下左右的走，问你删掉命令里面的哪一段命令可以使机器人的运行结果一样。样例中暗含：如果有多个结果，求最短的，最先出现的一段。
解题思路
感谢宾宾大佬搞出来的神奇解法
我是看懂了以后给大家简单介绍一下，思路是将每一个不同的状态用一个特殊的值存起来，向上向下向左向右分别用一个不可能重复的值来记录。
const ll inf = ll(2e5 + 9);
m['U'] = 1;
m['D'] = -1;
m['R'] = inf;
m['L'] = -inf;
这里要注意，‘U’、‘D’ 使用 1 、-1 而对应的 ‘R’、‘L’ 的值应该大于 2·10^5 因为全 U 的话状态值就是 2·10^5 ，如果 ‘R’、‘L’ 的状态值小于 2·10^5 的话那就可能出现不同状态同一特征值的情况，所以 inf = 2e5 + 9 。
接下来我们用 map 容器来储存一个状态值对应的操作序号，储存好以后，如果找到状态值相同的两段操作，说明这两个标记中间的操作都是没有意义的，也就是说可以去掉，因此这一段就记录为可以删除的一段。
遍历整个字符串，找到最短的一段无意义命令，输出即可。
ps：那个字符串 o 的遍历不理解的可以取看一看猹的 STL进阶 博客 STL Plus
代码
#include
#include