Pagini recente » Cod sursa (job #1312364) | Cod sursa (job #2473853) | Cod sursa (job #1732794) | Cod sursa (job #971145) | Cod sursa (job #1036083)
#include <iostream>
#include <fstream>
using namespace std;
int n,t,lis[3501],maxx,x[3501],y[3501],z[3501];
int main()
{
int i,j,a;
freopen("cutii.in","r",stdin);
freopen("cutii.out","w",stdout);
cin>>n>>t;
while(t>0)
{
for(i=1;i<=n;i++)
{
cin>>x[i];
cin>>y[i];
cin>>z[i];
}
lis[n]=1;
for(i=n-1;i>=1;i--)
{
maxx=0;
for(j=i+1;j<=n;j++)
{
if(x[i]<=x[j] && y[i]<=y[j] && z[i]<=z[j] && maxx<lis[j])
{
maxx=lis[j];
}
}
lis[i]=maxx+1;
}
maxx=1;
for(i=1;i<=n;i++)
{
if(maxx<lis[i])
maxx=lis[i];
}
cout<<maxx<<"\n";
t--;
}
return 0;
}