A -- A. Quailty and Playing Cards 模拟 + 思考

http://www.ifrog.cc/acm/problem/1036?contest=1005&no=0

分类，考虑Q神出的是第一张或者是第二张，然后对手出那些牌来应付。

Q神出第一张和第二张的情况是分开的，应该取两者的最大值。（因为要取最优情况）

而Q神出第一张的时候，对手出任意一张，是取min，保证对手出牌最优

注意这里花色是没用的。

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;
#define inf (0x3f3f3f3f)
typedef long long int LL;

#include <iostream>
#include <sstream>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <string>
int book[];
struct node {
    int num, val;
} a[];
int add(int val) {
    if (val != ) return val;
    else return ;
}
int judge(node a, node b, int who) {
    if (a.num > b.num) {
        return add(a.num);
    } else if (a.num == b.num) {
        if (who == ) {
            return add(a.num);
        } else return -add(b.num);
    } else {
        return -add(b.num);
    }
}
void work() {
    for (int i = ; i <= ; ++i) {
        char str[];
        scanf("%s", str + );
        a[i].num = book[str[]];
        a[i].val = book[str[]];
    }
//    for (int i = 1; i <= 4; ++i) {
//        cout << a[i].num << " " << a[i].val << endl;
//    }
//    cout <<"***" << endl;
    int ans = inf;
    int t = ;
    if (judge(a[], a[], ) > ) {
        t += judge(a[], a[], );
        t += judge(a[], a[], );
    } else {
        t += judge(a[], a[], );
        t += judge(a[], a[], );
    }
    ans = min(ans, t);
    t = ;
    if (judge(a[], a[], ) > ) {
        t += judge(a[], a[], );
        t += judge(a[], a[], );
    } else {
        t += judge(a[], a[], );
        t += judge(a[], a[], );
    }
    ans = min(ans, t);

    t = ;
    int ans2 = inf;
    if (judge(a[], a[], ) > ) {
        t += judge(a[], a[], );
        t += judge(a[], a[], );
    } else {
        t += judge(a[], a[], );
        t += judge(a[], a[], );
    }
    ans2 = min(ans2, t);
    t = ;
    if (judge(a[], a[], ) > ) {
        t += judge(a[], a[], );
        t += judge(a[], a[], );
    } else {
        t += judge(a[], a[], );
        t += judge(a[], a[], );
    }

    ans2 = min(ans2, t);

//    cout << ans << " " << ans2 << endl;

    ans = max(ans, ans2);
    cout << ans << endl;
}
int main() {
#ifdef local
    freopen("data.txt","r",stdin);
#endif
    book['A'] = ;
    book['K'] = ;
    book['Q'] = ;
    book['J'] = ;
    book['T'] = ;
    for (int i = ''; i <= ''; ++i) {
        book[i] = i - '';
    }
    book['H'] = ;
    book['S'] = ;
    book['C'] = ;
    book['D'] = ;
    int t;
    scanf("%d", &t);
    while(t--) {
        work();
    }
    return ;
}