hdu 1050 Moving Tables（贪心）

hdu 1050 Moving Tables（贪心）
添加链接描述

#include <bits/stdc++.h>
using namespace std;
#define MXN 210
int n, r[MXN<<1], c[MXN]; 
int main(){
    int T, n, s, t;
    scanf("%d", &T);
    for(int i = 1; i <= 200; i++)
        r[i<<1] = i, r[(i<<1)-1] = i;
    while(T--){
        memset(c, 0, sizeof c);
        scanf("%d", &n);
        for(int i = 1; i <= n; i++){
            scanf("%d %d", &s, &t);
            s = r[s], t = r[t]; 
            int tmp;
            if(s > t) tmp = t, t = s, s = tmp; 
            for(int i = s; i <= t; i++) c[i]++;
        }
        for(int i = 1; i <= 200; i++) c[0] = max(c[0], c[i]);
        printf("%d\n", c[0]*10);
    }    
    return 0;
}