Pagini recente » Istoria paginii runda/bulangandit6/clasament | Cod sursa (job #373237) | Cod sursa (job #2382695) | Istoria paginii runda/abcdefghijklmnop | Cod sursa (job #1134050)
#include<fstream>
#include<algorithm>
#define NMAX 3505
using namespace std;
ifstream fin("cutii.in");
ofstream fout("cutii.out");
class ppp
{
public:
short x,y,z;
bool operator <(ppp &aux)
{
return (x<aux.x && y<aux.y && z<aux.y);
}
bool operator >(ppp &aux)
{
return (x>aux.x && y>aux.y && z>aux.y);
}
bool operator ()(const ppp &a,const ppp &b)
{
if(a.x==b.x)
{
if(a.y==b.y)
return a.z<b.z;
return a.y<b.y;
}
return a.x<b.x;
}
}v[NMAX];
int n,t,DP[NMAX];
void scmax()
{
int l=1;
DP[1]=1;
for(int i=2;i<=n;i++)
{
if(v[i]>v[DP[l]])
{
DP[++l]=i;
continue;
}
int L=1,R=l,middle=1;
while(L<R)
{
middle=(L+R)/2;
if(v[DP[middle]]<v[i])
L=middle+1;
else
R=middle;
}
if(v[DP[middle]]>v[i])
DP[middle]=i;
}
fout<<l<<'\n';
}
int main()
{
fin>>n>>t;
while(t--)
{
for(int i=1;i<=n;i++)
fin>>v[i].x>>v[i].y>>v[i].z;
sort(v+1,v+n+1,v[0]);
scmax();
}
return 0;
}