# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
62796 | BBang3 | 조화행렬 (KOI18_matrix) | C++14 | 4017 ms | 4108 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <cstdio>
#include <algorithm>
using namespace std;
struct H
{
int a;
int b;
H() {}
H(int a, int b) : a(a), b(b) {}
bool operator < (const H &t)
{
return a < t.a;
}
};
int N, M;
int arr[3][200000 + 5];
H matrix[200000 + 5];
int D[200000 + 5];
int main()
{
scanf("%d %d", &M, &N);
for (int i = 0; i < M; i++)
{
for (int j = 1; j <= N; j++)
{
scanf("%d", &arr[i][j]);
}
}
int ans = 1;
if (M == 2)
{
for (int i = 1; i <= N; i++)
{
matrix[i] = H(arr[0][i], arr[1][i]);
}
sort(matrix + 1, matrix + 1 + N);
for (int i = 1; i <= N; i++)
{
D[i] = 1;
for (int j = 1; j < i; j++)
{
if (matrix[j].b < matrix[i].b)
{
D[i] = max(D[i], D[j] + 1);
ans = max(ans, D[i]);
}
}
}
}
printf("%d", ans);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |