Pagini recente » Cod sursa (job #1025119) | Cod sursa (job #1446404) | Cod sursa (job #317148) | Cod sursa (job #1457541) | Cod sursa (job #2289875)
#include <bits/stdc++.h>
using namespace std;
ifstream f ("cutii.in");
ofstream g ("cutii.out");
const int nmax=5e3+3;
int d[nmax],sol,n,t;
struct usu
{
int a,b,c;
inline bool operator < (const usu &t1) const
{
if(t1.a>a) return 1;
if(t1.a<a) return 0;
if(t1.b>b) return 1;
if(t1.b<b) return 0;
return t1.c>c;
}
}v[nmax];
int main()
{
ios::sync_with_stdio(false);
f>>n>>t;
while(t--)
{
memset(d,0,sizeof(d));
for(int i=1;i<=n;++i) f>>v[i].a>>v[i].b>>v[i].c;
sort(v+1,v+n+1);
d[1]=1;
sol=1;
for(int i=2;i<=n;++i)
{
for(int j=1;j<i;++j)
{
if(v[j].a<v[i].a&&v[j].b<v[i].b&&v[j].c<v[i].c) d[i]=max(d[i],d[j]+1);
}
sol=max(sol,d[i]);
}
g<<sol<<'\n';
}
return 0;
}