Pagini recente » Cod sursa (job #2369685) | Cod sursa (job #2305858) | Cod sursa (job #2756289) | Cod sursa (job #1847202) | Cod sursa (job #2502877)
#include <fstream>
#define y first
#define z second
using namespace std;
ifstream fin("cutii.in");
ofstream fout("cutii.out");
int n,T,i,j,k,st,dr,mid,cnt,d[3501],t[3501],u,sol;
pair<int,int> v[3501];
int main(){
fin>>n;
for(fin>>T;T;T--){
for(i=1;i<=n;i++){
fin>>j;
fin>>v[j].y>>v[j].z;
}
sol=-1;
for(i=1;i<=n;i++){
d[i]=1;
for(j=1;j<i;j++)
if(v[j].y<v[i].y && v[j].z<v[i].z)
d[i]=max(d[i],d[j]+1);
sol=max(sol,d[i]);
}
fout<<sol<<"\n";;
}
return 0;
}