UVa 103 - Stacking Boxes

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
//#include <unordered_set>
//#include <unordered_map>
#include <queue>
//#include <ctime>
//#include <cassert>
//#include <complex>
#include <string>
#include <cstring>
//#include <chrono>
//#include <random>
#include <bitset>
using namespace std;
//using namespace chrono;
#define pb push_back
#define FastIO ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define F first
#define S second
typedef long long ll;
typedef vector< int > vi;
typedef vector< ll > V;
typedef map<int, int > mp;
#define debug cout << -1 << endl;
#define REP(i, a, b) for(int i=a; i<b; i++)
#define f0r(i, n) for (int i = 0; i < n; ++i)
#define fore(a, x) for (auto& a : x)
#define fori(i, a, b) for (int i = (a); i < (b); ++i)
//#define pop pop_back
#define sz(a) (int)a.size()
//#define fin cin
//#define fout cout
const ll MOD = 1000000007;
const int INF = (int)1e9;
int dx[] = {-1, 0, 1, -1, 1, -1, 0, 1};
int dy[] = {-1, -1, -1, 0, 0, 1, 1, 1};
const double PI = acos(-1.0);
const double diff = 1e-6;
int n, m;

bool cmp(vector< int > a, vector< int > b)
{
    for(int i=0; i<m; i++) {
        if(a[i] >= b[i]) return false;
    }
    return true;
}

void solve()
{
    while(cin >> n >> m) {
        vector< pair< vector< int >, int > > v(n);
        for(int i=0; i<n; i++) {
            for(int j=0; j<m; j++) {
                int x;
                cin >> x;
                (v[i].F).pb(x);
            }
            sort((v[i].F).begin(), (v[i].F).end());
            v[i].S = i+1;
        }
        sort(v.begin(), v.end());
        vector< pair< int, vector< int > > > ans(n);
        for(int i=0; i<n; i++) {
            ans[i].F = 1;
            (ans[i].S).pb(v[i].S);
        }
        for(int i=0; i<n; i++){
            for(int j=0; j<i; j++) {
                if(cmp(v[j].F, v[i].F)) {
                    if(1 + ans[j].F > ans[i].F) {
                        ans[i].F = 1+ans[j].F;
                        (ans[i].S).clear();
                        //int xx = sz(ans[j].S);
                        for(auto x: ans[j].S) {
                            (ans[i].S).pb(x);
                        }
                        (ans[i].S).pb(v[i].S);
                    }
                }
            }
        }
        int mx = 0;
        int pos = -1;
        for(int i=0; i<n; i++) {
            if(mx < ans[i].F) {
                mx = ans[i].F;
                pos = i;
            }
        }
        cout << mx << "\n";
        for(auto xl: ans[pos].S) {
            cout << xl << " ";
        }
        cout << "\n";
    }
}

int main()
{
    int t;
    t = 1;
    //cin >> t;
    while(t--) {
        solve();
    }
}