Pagini recente » Cod sursa (job #2289448) | Cod sursa (job #982502) | Cod sursa (job #874490) | Clasament preONI 2007, Clasele 11-12 | Cod sursa (job #1195372)
#include <cstdio>
#define nmax 3501
using namespace std;
int x[nmax],y[nmax],z[nmax],i,lis[nmax],j,maxim;
int main()
{
freopen("cutii.in","r",stdin);
freopen("cutii.out","w",stdout);
int t,n;
scanf("%d%d",&n,&t);
while(t)
{
for(i=1;i<=n;i++)
scanf("%d%d%d",&x[i],&y[i],&z[i]);
lis[n]=1;
for(i=n;i>0;i--)
{
maxim=0;
for(j=i+1;j<=n;j++)
{
if(maxim<lis[j]&&x[i]<x[j]&&y[i]<y[j]&&z[i]<z[j])
maxim=lis[j];
}
lis[i]=maxim+1;
}
maxim=lis[1];
for(i=2;i<=n;i++)
{
if(lis[i]>maxim)
maxim=lis[i];
}
printf("%d\n",maxim);
t--;
}
return 0;
}