Pagini recente » Cod sursa (job #284956) | Cod sursa (job #1029946) | Cod sursa (job #108946) | Cod sursa (job #2931491) | Cod sursa (job #419080)
Cod sursa(job #419080)
//#define FOR(i,a,b) for(i=a;i<=b;i++)
//#define FORi(i,a,b) for(i=a;i>=b;i--)
#include <cstdio>
#include <fstream>
using namespace std;
struct cutie{
int x,y,z;
}c[3501];
int set[3501];
int maxi,j,n,i,t;
int comp(cutie a, cutie b)
{
return a.x<b.x;
}
int main()
{
freopen("cutii.in","r",stdin);
freopen("cutii.out","w",stdout);
scanf("%d%d",&n,&t);
while (t--)
{
for(i=1;i<=n;i++) scanf("%d%d%d",&c[i].x,&c[i].y,&c[i].z);
sort(c+1,c+n+1,comp);
maxi=1;
for(i=1;i<=n;i++)
{
set[i]=1;
for(j=i-1;j>=1;j--)
{
if (c[i].y>c[j].y && c[i].z>c[j].z && set[j]>=set[i])
set[i]=set[j]+1;
if (set[i]>maxi) maxi=set[i];
}
}
printf("%d\n",maxi);
}
return 0;
}