Pagini recente » Cod sursa (job #1666347) | Cod sursa (job #174629) | Cod sursa (job #2960698) | Cod sursa (job #768749) | Cod sursa (job #174746)
Cod sursa(job #174746)
#include <fstream>
using namespace std;
fstream in,out;
int i,j,k;
int t,n;
int m,mt;
int x[3501];
struct cutie
{
int x,y,z;
};
cutie v[3501];
void sorteaza(cutie v[],int n)
{
int i,j;
cutie aux;
for(i=1;i<=n;i++)
for(j=i+1;j<=n;j++)
if(v[i].x>v[j].x && v[i].y>v[j].y && v[i].z>v[j].z)
{
aux=v[i];
v[i]=v[j];
v[j]=aux;
}
}
int main()
{
in.open("cutii.in",ios::in);
out.open("cutii.out",ios::out);
in>>n>>t;
for(k=1;k<=t;k++)
{
mt=0;
for(i=1;i<=n;i++)
in>>v[i].x>>v[i].y>>v[i].z;
for(i=1;i<=n;i++)
{
m=0;
for(j=1;j<i;j++)
if(x[j]>m && v[i].x>v[j].x && v[i].y>v[j].y && v[i].z>v[j].z)
m=x[j];
x[i]=m+1;
if(mt<m+1) mt=m+1;
}
out<<mt<<endl;
}
in.close();
out.close();
return 0;
}