Cod sursa(job #956647)
| Utilizator | Data | 3 iunie 2013 16:06:32 | |
|---|---|---|---|
| Problema | Cutii | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.75 kb |
#include<fstream>
using namespace std;
ifstream f("cutii.in");
ofstream g("cutii.out");
int n,t,i,j,a[3501],b[3501],c[3501],x,y,z,max1,k;
int main()
{
f>>n>>t;
for(i=1;i<=t;i++)
{
for(j=1;j<=n;j++)
{
f>>x>>y>>z;
a[x]=y;
b[x]=z;
}
c[1]=1;
max1=1;
for(j=2;j<=n;j++)
{
c[j]=1;
for(k=j-1;k>=1;k--)
{
if(a[k]<a[j])
if(b[k]<b[j])
if(c[j]<c[k]+1)
{
c[j]=c[k]+1;
if(c[j]>max1)
max1=c[j];
}
}
}
g<<max1<<"\n";
}
return 0;
}