Pagini recente » Cod sursa (job #3254015) | Cod sursa (job #174504)
Cod sursa(job #174504)
#include <fstream>
using namespace std;
fstream in,out;
int i,j,k;
int t,n;
int v1[3501],v2[3501],v3[3501];
int m,mt;
int x[3501];
int main()
{
in.open("cutii.in",ios::in);
out.open("cutii.out",ios::out);
in>>n>>t;
for(k=1;k<=t;k++)
{
mt=0;
for(i=1;i<=n;i++)
{
in>>v1[i]>>v2[i]>>v3[i];
m=0;
for(j=1;j<i;j++)
if((m<x[j]) && ((v1[i]>v1[j] && v2[i]>v2[j] && v3[i]>v3[j])||
(v1[i]>v1[j] && v2[i]>v3[j] && v3[i]>v2[j])||
(v1[i]>v2[j] && v2[i]>v1[j] && v3[i]>v3[j])||
(v1[i]>v2[j] && v2[i]>v3[j] && v3[i]>v2[j])||
(v1[i]>v3[j] && v2[i]>v1[j] && v3[i]>v3[j])||
(v1[i]>v3[j] && v2[i]>v2[j] && v3[i]>v1[j])))
m=x[j];
x[i]=m+1;
if(mt<m+1) mt=m+1;
}
out<<mt<<endl;
}
in.close();
out.close();
return 0;
}