Pagini recente » Cod sursa (job #2117467) | Cod sursa (job #1173975) | Cod sursa (job #1602240) | Cod sursa (job #1073700) | Cod sursa (job #655813)
Cod sursa(job #655813)
#include <fstream>
#define nmax 3501
using namespace std;
int l[nmax], x[nmax], y[nmax], z[nmax];
int n, t;
ifstream f("cutii.in");
ofstream g("cutii.out");
void citeste(){
f>>n>>t;
}
void cit(){
for(int i=1; i<=n; ++i) f>>x[i]>>y[i]>>z[i];
}
void rezolva(){
int mx;
for(int i=0; i<=n; ++i) l[i] = 0;
l[n] = 1;
for(int i=n-1; i>=1; i--){
mx = 0;
for(int j=i+1; j<=n; ++j)
if (x[j] > x[i] && y[j] > y[i] && z[j] > z[i] && mx < l[j] ) mx = l[j];
l[i] = mx + 1;
}
mx = 0;
for(int i=1; i<=n; ++i){
if (mx < l[i]) mx = l[i];
}
g<<mx<<"\n";
}
void rez(){
for(int i=1; i<=t; ++i){
cit();
rezolva();
}
}
int main(){
citeste();
rez();
f.close();
g.close();
return 0;
}