Pagini recente » Cod sursa (job #2982119) | Cod sursa (job #3139610) | Cod sursa (job #1255635) | Cod sursa (job #2452240) | Cod sursa (job #2442515)
#include <fstream>
using namespace std;
ifstream f("cutii.in");
ofstream g("cutii.out");
struct cutii
{
int u,d,t;
};
cutii v[3505];
int n,m,l[3505],i,j,Max,lmax;
bool mm(int i, int j)
{
if(v[j].u>v[i].u && v[j].d>v[i].d && v[j].t>v[i].t)
return true;
return false;
}
int main()
{
f>>n>>m;
for(int p=1; p<=m; p++)
{
for(i=1; i<=n; i++)
f>>v[i].u>>v[i].d>>v[i].t,l[i]=0;
l[n]=1;
lmax=0;
for(i=n-1; i>=1; i--)
{
Max=0;
for(j=i+1; j<=n; j++)
if(mm(i,j)==true && l[j]>Max)
Max=l[j];
l[i]=Max+1;
if(l[i]>lmax)
{
lmax=l[i];
}
}
g<<lmax<<'\n';
}
return 0;
}