C. Vasya and Robot

https://codeforc.es/contest/1073/problem/C

题意：给一串命令；问是否到达终点(x,y)；可以改变任意字串的命令，改变长度为最远的-最近的+1；问最小的长度，或者不行就-1；

思路：记录x轴的前缀和和y轴的前缀和，二分长度然后尺取如果len和区间外的步数满奇偶相同和小于len就行；奇偶相同保证不会多出一步不能抵消；

#include<algorithm>
#include<set>
#include<queue>
#include<cmath>
#include<cstring>
#include<iostream>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstdio>
#include<map>
#include<stack>
#include<string>
#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-16
#define PI acos(-1)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson rt<<1,l,mid
#define rson rt<<1|1,mid+1,r
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

const int maxn=1e6+9;
const int mod=998244353;

inline ll read()
{
    ll f=1,x=0;
    char ss=getchar();
    while(ss<'0'||ss>'9')
    {
        if(ss=='-')f=-1;ss=getchar();
    }
    while(ss>='0'&&ss<='9')
    {
        x=x*10+ss-'0';ss=getchar();
    }    return f*x;
}

ll power(ll x,ll n)
{
    ll ans=1;
    while(n)
    {
        if(n&1) ans=ans*x%mod;
        x=x*x%mod;
        n>>=1;
    }
    return ans;
}

int n,x,y;
string s;
int sumx[maxn],sumy[maxn];
bool ch(int len)
{
    int l=1;
    int r=l+len-1;
    while(r<=n)
    {
        int xx=sumx[l-1];
        int yy=sumy[l-1];
        xx+=sumx[n]-sumx[r];
        yy+=sumy[n]-sumy[r];
        int st=abs(xx-x)+abs(yy-y);
        //cout<<xx<<" "<<yy<<endl;
        if(st<=len&&(st%2==len%2)) return 1;
        l++;
        r++;
    }
    return 0;
}
int main()
{
    //FAST_IO;
    //freopen("input.txt","r",stdin);

    bool f=0;
    cin>>n;
    cin>>s;
    cin>>x>>y;
    for(int i=0;i<n;i++)
    {
        if(s[i]=='R')
        {
            sumx[i+1]=sumx[i]+1;
            sumy[i+1]=sumy[i];
        }
        else if(s[i]=='L')
        {
            sumx[i+1]=sumx[i]-1;
            sumy[i+1]=sumy[i];
        }
        else if(s[i]=='U')
        {
            sumx[i+1]=sumx[i];
            sumy[i+1]=sumy[i]+1;
        }
        else
        {
            sumx[i+1]=sumx[i];
            sumy[i+1]=sumy[i]-1;
        }
        if(sumx[i]==x&&sumy[i]==y) f=1;
    }
    /*for(int i=1;i<=n;i++)
    {
        cout<<sumy[i]<<" ";
    }*/
    if((n<abs(x)+abs(y))||(n%2!=(abs(x)+abs(y))%2))
    {
        cout<<-1<<endl;
        return 0;
    }
    int ans=-1;
    int l=0;
    int r=n;
    while(l<=r)
    {

        int mid=(l+r)>>1;
        //cout<<mid<<endl;
        if(ch(mid))
        {
            ans=mid;
            r=mid-1;
        }
        else l=mid+1;
    }
    cout<<ans<<endl;
	return 0;
}