【BestCoder】 HDOJ 5162 Jump and Jump...

简单水题。。。

#include <iostream>
#include <queue> 
#include <stack> 
#include <map> 
#include <set> 
#include <bitset> 
#include <cstdio> 
#include <algorithm> 
#include <cstring> 
#include <climits>
#include <cstdlib>
#include <cmath>
#include <time.h>
#define maxn 20005
#define maxm 400005
#define eps 1e-10
#define mod 1000000007
#define INF 0xi3f3f3f3f
#define PI (acos(-1.0))
#define lowbit(x) (x&(-x))
#define mp make_pair
#define ls o<<1
#define rs o<<1 | 1
#define lson o<<1, L, mid 
#define rson o<<1 | 1, mid+1, R
#define pii pair<int, int>
//#pragma comment(linker, "/STACK:16777216")
typedef long long LL;
typedef unsigned long long ULL;
//typedef int LL;
using namespace std;
LL qpow(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base;base=base*base;b/=2;}return res;}
LL powmod(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base%mod;base=base*base%mod;b/=2;}return res;}
// head

int res[maxn];
int n;

struct node
{
    int x, id;
}p[maxn];

void read()
{
    int a, b, c;
    scanf("%d", &n);
    for(int i = 1; i <= n; i++) {
        scanf("%d%d%d", &a, &b, &c);
        p[i].x = max(a, max(b, c));
        p[i].id = i;
    }
}

int cmp(node a, node b)
{
    return a.x > b.x;
}

void work()
{
    sort(p+1, p+n+1, cmp);
    for(int i = 1; i <= n; i++) res[p[i].id] = i;
    for(int i = 1; i <= n; i++) printf("%d%c", res[i], i == n ? '\n' : ' ');
}

int main(void)
{
    int _;
    while(scanf("%d", &_)!=EOF) {
        while(_--) {
            read();
            work();
        }
    }


    return 0;
}