Pagini recente » Cod sursa (job #678681) | Cod sursa (job #1508755) | Cod sursa (job #2920580) | Cod sursa (job #849210) | Cod sursa (job #2282717)
// incercare
# include <stdio.h>
using namespace std;
const int MAXN=3501;
typedef struct
{
int x,y,z;
} CUTIE;
typedef CUTIE CUTII[MAXN+1];
CUTII cut;
int n;
int calculeaza()
{
int c[MAXN+1]= {0};
c[1]=1;
int i,j,sol;
for (i=2; i<=n; i++)
{
c[i]=1;
for (j=1; j<=i-1; j++)
if (c[j]+1>c[i]&&cut[j].y<cut[i].y&&cut[j].z<cut[i].z)
c[i]=c[j]+1;
}
sol=1;
for (i=1; i<=n; i++) if (c[i]>sol) sol=c[i];
return sol;
}
int main()
{
int t,i,xx,yy,zz,qwd;
FILE *f=fopen("cutii.in","r");
FILE *g=fopen("cutii.out","w");
fscanf(f,"%d%d",&n,&t);
for (qwd=1; qwd<=t; qwd++)
{
for (i=1; i<=n; i++)
{
fscanf(f,"%d%d%d",&xx,&yy,&zz);
cut[xx].x=xx;
cut[xx].y=yy;
cut[xx].z=zz;
}
fprintf(g,"%d\n",calculeaza());
}
return 0;
}