Pagini recente » Cod sursa (job #2469862) | Cod sursa (job #916375) | Cod sursa (job #2029511) | Cod sursa (job #824041) | Cod sursa (job #53748)
Cod sursa(job #53748)
#include <iostream.h>
#include<fstream.h>
int n,t,i,j,a[3500],b[3500],c[3500],max[3500],ma;
int main(){
fstream f("cutii.in",ios::in);
fstream g("cutii.out",ios::out);
f>>n>>t;
while(t>0)
{
for(i=1;i<=n;i++)
f>>a[i]>>b[i]>>c[i];
t--;
for(i=1;i<=n;i++)
{
max[i]=0;
for(j=1;j<=n;j++)
{
if(a[i]<a[j])
{
if(b[i]<b[j])
{
if(c[i]<c[j])
max[i]++;
}
}
}
}
ma=max[1];
for(i=2;i<=n;i++)
if(ma<max[i])
ma=max[i];
g<<ma+1<<endl;
}
system("PAUSE");
}