Wunder Fund Round 2016 (Div. 1 + Div. 2 combined) B. Guess the Permutation

题意：给你一个数字n，然后1-n数字之间有很多排列，求得一个排列，使得ai, j = min(pi, pj).(a[i][j]为矩阵中的值）

题解：直接找每行最大值就行，判断一下之前是否出现过n-1就好

#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <cmath>
#include <vector>
#include <string>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define L(i) i<<1
#define R(i) i<<1|1
#define INF  0x3f3f3f3f
#define pi acos(-1.0)
#define eps 1e-9
#define maxn 1000100
#define MOD 1000000007

int n;
int a[55][55];

int main()
{
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    int t,C = 1;
    //scanf("%d",&t);
    while(scanf("%d",&n) != EOF)
    {
        int ans[55],flag = 1;
        for(int i = 0; i < n; i++)
        {
            int Max = 0;
            for(int j = 0; j < n; j++)
            {
                scanf("%d",&a[i][j]);
                Max = max(Max,a[i][j]);
            }
            if(Max == n-1)
            {
                if(flag)
                {
                    flag = 0;
                    ans[i] = Max;
                }
                else
                    ans[i] = Max + 1;
            }
            else
                ans[i] = Max;
        }
        for(int i = 0; i < n; i++)
            printf("%d ",ans[i]);
        printf("\n");
    }
    return 0;
}