Pagini recente » Cod sursa (job #686035) | Cod sursa (job #1943331) | Cod sursa (job #757684) | Cod sursa (job #1884427) | Cod sursa (job #1920555)
#include <bits/stdc++.h>
using namespace std;
ifstream f("cutii.in");
ofstream g("cutii.out");
struct CUTIE{int x,y,z;} cutie[3501] ;
int n;
int calculeaza()
{
int c[3501]={0};
c[1]=1;int i,j,nrmax;
//c[i]=numarul de cutii care intra in sir cresc in cutia i
for (i=2;i<=n;i++)
{
c[i]=1;
for (j=1;j<=i-1;j++)
if (c[j]+1>c[i] && cutie[j].y<cutie[i].y && cutie[j].z<cutie[i].z)
c[i]=c[j]+1;
}
nrmax=1;
for (i=1;i<=n;i++)
if (c[i]>nrmax) nrmax=c[i];
return nrmax;
}
int main()
{
int t,i,x,y,z,j;
f>>n>>t;
for(j=1;j<=t;j++)
{
for (i=1;i<=n;i++)
{
f>>x>>y>>z;//x ia valorile de la 1 la n, deci x este numarul cutiei
cutie[x].x=x;cutie[x].y=y;cutie[x].z=z;
}
g<<calculeaza()<<'\n';
}
f.close();g.close();return 0;
}