Pagini recente » Cod sursa (job #2810180) | Cod sursa (job #651065) | Cod sursa (job #2843961) | Cod sursa (job #1555494) | Cod sursa (job #2155932)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("cutii.in");
ofstream g("cutii.out");
struct cutie
{
int x,y,z;
};
cutie a[3501];
int t,n,d[3501],i,j,r,maxim;
int main()
{
f>>n>>t;
while(t--)
{
for(i=1;i<=n;i++)
{
f>>a[i].x>>a[i].y>>a[i].z;
}
d[n]=1;
r=1;
for(i=n-1;i>=1;i--)
{
maxim=0;
for(j=i+1;j<=n;j++)
{
if(d[j]>maxim && a[i].x<a[j].x && a[i].y<a[j].y && a[i].z<a[j].z)
{
maxim=d[j];
}
}
d[i]=maxim+1;
if(d[i]>r)
{
r=d[i];
}
}
g<<r<<"\n";
}
return 0;
}