Pagini recente » Cod sursa (job #1452902) | Cod sursa (job #2403180) | Cod sursa (job #2273793) | Cod sursa (job #240493) | Cod sursa (job #3198842)
#include <bits/stdc++.h>
#define N_MAX 3505
using namespace std;
ifstream fin("cutii.in");
ofstream fout("cutii.out");
struct cutie
{
int x, y, z;
} v[N_MAX];
int dp[N_MAX], n, t;
bool comp(cutie a, cutie b)
{
return a.z < b.z;
}
int main()
{
fin >> n >> t;
while (t--)
{int rez=0;
for (int i = 1; i <= n; i++)
{
fin >> v[i].x >> v[i].y >> v[i].z;
dp[i] = 1;
}
sort(v + 1, v + n + 1, comp);
for (int i = 1; i < n; i++)
for (int j = i + 1; j <= n; j++)
{
if (v[i].x < v[j].x && v[i].y < v[j].y)
{
dp[j] = max(dp[j], dp[i] + 1);
rez=max(rez,dp[j]);
}
}
fout<<rez<<'\n';
}
}