Pagini recente » Cod sursa (job #2630870) | Cod sursa (job #1591507) | Cod sursa (job #2623235) | Cod sursa (job #573256) | Cod sursa (job #2246920)
#include <fstream>
#include <iostream>
#include <vector>
using namespace std;
ifstream f("cutii.in");
ofstream g("cutii.out");
int d[100001],n,s[100001],ax,piv,p;
struct elem
{
int x,y,z;
};
bool cmp(elem a,elem b)
{
return(a.x<b.x&&a.y<b.y&&a.z<b.z);
}
int main()
{
f>>n>>p;
elem a[100001];
for(int l=1;l<=p;l++)
{for(int i=1;i<=n;i++)
{f>>a[i].x>>a[i].y>>a[i].z;
d[i]=1;
}
int m=0;
for(int k=1;k<=n;k++)
{
if(m<d[k])
{
m=d[k];
piv=k;
}
for(int j=k+1;j<=n;j++)
if(cmp(a[k],a[j]))
d[j]=max(d[j],d[k]+1);
}
g<<m<<"\n";
}
return 0;
}