Pagini recente » Cod sursa (job #1647600) | Cod sursa (job #2867501) | Cod sursa (job #1605234) | Cod sursa (job #665015) | Cod sursa (job #3268895)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("cutii.in");
ofstream fout("cutii.out");
struct Cutie {
int x, y, z;
bool operator<(Cutie c) const {
return x < c.x;
}
} c[3502];
int n, t, i, j, lg[3502], rasp;
static inline bool Incape(Cutie a, Cutie b) {
return (a.x > b.x && a.y > b.y && a.z > b.z);
}
int main() {
fin >> n >> t;
while(t--) {
for(i = 1; i <= n; i++) fin >> c[i].x >> c[i].y >> c[i].z;
sort(c + 1, c + n + 1);
rasp = 0;
for(i = 1; i <= n; i++) {
lg[i] = 1;
for(j = 1; j < i && Incape(c[i], c[j]); j++) {
lg[i] = max(lg[i], lg[j] + 1);
}
rasp = max(rasp, lg[i]);
}
fout << rasp << "\n";
}
return 0;
}