Cod sursa(job #2332663)
Utilizator | Data | 30 ianuarie 2019 22:55:59 | |
---|---|---|---|
Problema | Cutii | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 1.18 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream cin("cutii.in");
ofstream cout("cutii.out");
const int N=3500+7;
struct info
{
int a;
int b;
int c;
};
bool cmp(info f,info s)
{
return f.a<s.a;
}
info v[N];
int dp[N];
int main()
{
int n,t;
cin>>n>>t;
while(t--)
{
for(int i=1;i<=n;i++)
{
cin>>v[i].a;
cin>>v[i].b;
cin>>v[i].c;
dp[i]=1;
}
sort(v+1,v+n+1,cmp);
int res=1;
for(int i=1;i<=n;i++)
{
for(int j=1;j<i;j++)
{
if(v[j].b<v[i].b && v[j].c<v[i].c)
{
dp[i]=max(dp[i],1+dp[j]);
res=max(res,dp[i]);
}
}
}
cout<<res<<"\n";
}
return 0;
}
/**
**/