ZOJ4115 Wandering Robot

模拟 思维题

AC代码：

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;

char a[100005];

int main(){
    int t, n, k;
    cin>>t;
    ll x0, y0, x, y;
    ll ans1, ans2;
    while (t--){
        memset(a, 0, sizeof(a));
        cin>>n>>k;
        cin>>a;
        x0 = 0, y0 = 0;
        ans1 = 0, ans2 = 0;
        for (int i = 0; i < n; i++){
            if (a[i] == 'L') x0--;
            else if (a[i] == 'R') x0++;
            else if (a[i] == 'U') y0++;
            else if (a[i] == 'D') y0--;
            if (abs(x0) + abs(y0) > ans1)
                ans1 = abs(x0) + abs(y0);
        }
        ans2 = (k - 1) * (abs(x0) + abs(y0));
        x = x0 * (k - 1);
        y = y0 * (k - 1);
        for (int i = 0; i < n; i++){
            if (a[i] == 'L') x--;
            else if (a[i] == 'R') x++;
            else if (a[i] == 'U') y++;
            else if (a[i] == 'D') y--;
            ans2 = max(ans2, abs(x) + abs(y));
        }
        cout<<max(ans1, ans2)<<endl;
    }
    return 0;
}