UESTC 761 LoveZx与期末考试

#include<bits/stdc++.h>
using namespace std;

typedef long long ll;

const int LEN = 1e5+5, WEIGHT = 10;
char A[LEN];
char B[LEN];
int cnt[WEIGHT];

char calMax()
{
    for(int c = WEIGHT; c--;){
        if(cnt[c]) return c + ‘0‘;
    }
    return ‘0‘-1;
}

int solve()
{
    scanf("%s%s",A,B);
    int l1 = strlen(A), l2 = strlen(B);
    if(l2 < l1){
        return LEN;
    }
    if(l2 > l1){
        return 0;
    }

    memset(cnt,0,sizeof(cnt));
    int i, j;
    for(i = 0; i < l2; i++) {
        cnt[B[i]-‘0‘]++;
    }

    int cur_move = 0, ans = LEN;
    for(i = 0, j = 0; i < l1; i++){
        if(A[i] < B[j]) break;
        if(A[i] > B[j]){
            char mx = calMax();
            if(mx < A[i]) {
                cur_move = LEN; break;
            }
            cur_move++;
            if(mx > A[i]) break;
            cnt[mx - ‘0‘]--;
        }
        else {
            if(calMax() > A[i]) ans = min(cur_move+1,ans);
            cnt[B[j]-‘0‘]--;
            while(!cnt[B[++j]-‘0‘]);
        }
    }
    if(i < l1) ans = min(ans, cur_move); //equal
    return ans;
}

//#define LOCAL
int main()
{
#ifdef LOCAL
    freopen("in.txt","r",stdin);
#endif
    int T; scanf("%d",&T);
    while(T--){
        int res = solve();
        if(res < LEN) printf("%d\n", res);
        else puts("Poor LoveZx");
    }
    return 0;
}