CodeforcesContest1073problemCVasyaandRobot——尺取

Vasya has got a robot which is situated on an infinite Cartesian plane, initially in the cell (0,0). Robot can perform the following four kinds of operations:

U — move from (x,y) to (x,y&＃43;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&＃43;1,y).
Vasya also has got a sequence of n operations. Vasya wants to modify this sequence so after performing it the robot will end up in (x,y).

Vasya wants to change the sequence so the length of changed subsegment is minimum possible. This length can be calculated as follows: maxID−minID&＃43;1, where maxID is the maximum index of a changed operation, and minID is the minimum index of a changed operation. For example, if Vasya changes RRRRRRR to RLRRLRL, then the operations with indices 2, 5 and 7 are changed, so the length of changed subsegment is 7−2&＃43;1&＃61;6. Another example: if Vasya changes DDDD to DDRD, then the length of changed subsegment is 1.

If there are no changes, then the length of changed subsegment is 0. Changing an operation means replacing it with some operation (possibly the same); Vasya can’t insert new operations into the sequence or remove them.

Help Vasya! Tell him the minimum length of subsegment that he needs to change so that the robot will go from (0,0) to (x,y), or tell him that it’s impossible.

Input
The first line contains one integer number n (1≤n≤2⋅105) — the number of operations.

The second line contains the sequence of operations — a string of n characters. Each character is either U, D, L or R.

The third line contains two integers x,y (−109≤x,y≤109) — the coordinates of the cell where the robot should end its path.

Output
Print one integer — the minimum possible length of subsegment that can be changed so the resulting sequence of operations moves the robot from (0,0) to (x,y). If this change is impossible, print −1.

Examples
inputCopy
5
RURUU
-2 3
outputCopy
3
inputCopy
4
RULR
1 1
outputCopy
0
inputCopy
3
UUU
100 100
outputCopy
-1
Note
In the first example the sequence can be changed to LULUU. So the length of the changed subsegment is 3−1&＃43;1&＃61;3.

In the second example the given sequence already leads the robot to (x,y), so the length of the changed subsegment is 0.

In the third example the robot can’t end his path in the cell (x,y).

题意&＃xff1a;

给你一个长度为n的串&＃xff0c;仅含有4种字符
U — move from (x,y) to (x,y&＃43;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&＃43;1,y).
差不多这个意思&＃xff0c;就是移动的位置。
起始位置是0,0&＃xff0c;然后给你一个目标位置&＃xff0c;问你不可以增加&＃xff0c;不可以减小这个串的长度&＃xff0c;仅可以在其中选一个区间修改内容&＃xff0c;问你到目标位置最少需要改的长度是多少。

题解&＃xff1a;

首先特判目标位置的x&＃43;y大于n和目标位置与初始到达的位置是一样的情况&＃xff0c;之后就是尺取&＃xff0c;以前我都是用while来做&＃xff0c;但是听说for一遍r会更好一点&＃xff1f;那就试试看。每一个r我们找最大的l&＃xff0c;让(r-l&＃43;1)这个长度是能够从当前位置到达目标位置的长度&＃xff0c;但是要判断这两个是否奇偶&＃xff0c;举个例子:
6
RLRLRL
1 0
这种情况怎么样都不可能到达了&＃xff0c;因为(r-l&＃43;1)与位置偏差大小不是同奇偶的。

#include
using namespace std;
const int N&＃61;2e5&＃43;5;
char s[N];
mapmp;
int main()
{int sx&＃61;0,sy&＃61;0;int n;scanf("%d",&n);scanf("%s",s&＃43;1);int fx,fy;scanf("%d%d",&fx,&fy);if(abs(fx)&＃43;abs(fy)>n)return 0*printf("-1\n");for(int i&＃61;1;i<&＃61;n;i&＃43;&＃43;){if(s[i]&＃61;&＃61;&＃39;U&＃39;)sy&＃43;&＃43;;else if(s[i]&＃61;&＃61;&＃39;D&＃39;)sy--;else if(s[i]&＃61;&＃61;&＃39;L&＃39;)sx--;elsesx&＃43;&＃43;;}if(sx&＃61;&＃61;fx&&sy&＃61;&＃61;fy)return 0*printf("0\n");int l&＃61;1,minn&＃61;n&＃43;1;for(int r&＃61;1;r<&＃61;n;r&＃43;&＃43;){if(s[r]&＃61;&＃61;&＃39;U&＃39;)sy--;else if(s[r]&＃61;&＃61;&＃39;D&＃39;)sy&＃43;&＃43;;else if(s[r]&＃61;&＃61;&＃39;L&＃39;)sx&＃43;&＃43;;elsesx--;while(l<&＃61;r&&abs(fx-sx)&＃43;abs(fy-sy)<&＃61;r-l&＃43;1){if(((abs(fx-sx)&＃43;abs(fy-sy)))%2&＃61;&＃61;(r-l&＃43;1)%2)minn&＃61;min(minn,r-l&＃43;1);if(s[l]&＃61;&＃61;&＃39;U&＃39;)sy&＃43;&＃43;;else if(s[l]&＃61;&＃61;&＃39;D&＃39;)sy--;else if(s[l]&＃61;&＃61;&＃39;L&＃39;)sx--;elsesx&＃43;&＃43;;l&＃43;&＃43;;}}printf("%d\n",minn&＃61;&＃61;n&＃43;1?-1:minn);return 0;
}