test/cpv/library-checker-other/longest_increasing_subsequence.cpp
| Line | Branch | Exec | Source |
|---|---|---|---|
| 1 | // competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/longest_increasing_subsequence | ||
| 2 | #include "../../../src/io/container/lib.hpp" | ||
| 3 | #include "../../../src/opt/lis/lib.hpp" | ||
| 4 | |||
| 5 | using namespace tifa_libs; | ||
| 6 | CEXP u32 inf = 1145141919; | ||
| 7 | |||
| 8 | 19 | int main() { | |
| 9 |
1/2✓ Branch 2 taken 19 times.
✗ Branch 3 not taken.
|
19 | std::cin.tie(nullptr)->std::ios::sync_with_stdio(false); |
| 10 | u32 n; | ||
| 11 |
1/2✓ Branch 1 taken 19 times.
✗ Branch 2 not taken.
|
19 | std::cin >> n; |
| 12 |
1/2✓ Branch 1 taken 19 times.
✗ Branch 2 not taken.
|
19 | vecu a(n); |
| 13 | 19 | std::cin >> a; | |
| 14 | 19 | auto res = lis(a, inf); | |
| 15 |
1/2✓ Branch 2 taken 19 times.
✗ Branch 3 not taken.
|
19 | std::cout << res.size() << '\n' |
| 16 |
2/4✓ Branch 1 taken 19 times.
✗ Branch 2 not taken.
✓ Branch 5 taken 19 times.
✗ Branch 6 not taken.
|
19 | << res << '\n'; |
| 17 | 19 | return 0; | |
| 18 | 19 | } | |
| 19 |