Pagini recente » Borderou de evaluare (job #2860341) | Borderou de evaluare (job #2002355) | Clasament fmi-no-stress-9 | Borderou de evaluare (job #1745399) | Cod sursa (job #2889500)
//Ilie Dmitru
#include<fstream>
#include<cstdio>
typedef long long int ll;
const int NMAX=3505;
const ll MOD=194767;
FILE* f=fopen("cutii.in", "r"), *g=fopen("cutii.out", "w");
struct box
{
int y, z;
};
int N, len[NMAX];
box v[NMAX];
void solve()
{
int i, j, x, y, z, m=0;
for(i=0;i<N;++i)
{
fscanf(f, "%d%d%d", &x, &y, &z);
v[--x].y=y;
v[x].z=z;
len[x]=1;
}
for(i=0;i<N;++i)
{
for(j=0;j<i;++j)
if(len[j]+1>len[i] && v[i].y>v[j].y && v[i].z>v[j].z)
len[i]=len[j]+1;
if(len[i]>m)
m=len[i];
}
fprintf(g, "%d\n", m);
}
int main()
{
int T;
fscanf(f, "%d%d", &N, &T);
while(T--)
solve();
fclose(f);
fclose(g);
return 0;
}