Asa's CP Library
a01sa01to's competitive programming library. Requires C++20 or higher with GCC. This documentation is automatically generated by online-judge-tools/verification-helper
tests/misc/lis/libchecker.test.cpp
- View this file on GitHub
- Last update: 2025-12-21 19:31:20+09:00
- Problem: https://judge.yosupo.jp/problem/longest_increasing_subsequence
Depends on
Code
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
using ull = unsigned long long;
#include "../../../library/fastio.hpp"
#include "../../../library/misc/lis.hpp"
#define PROBLEM "https://judge.yosupo.jp/problem/longest_increasing_subsequence"
int main() {
int n;
asalib::in >> n;
vector<int> a(n);
rep(i, n) asalib::in >> a[i];
vector<int> res = asalib::misc::lis(a, true);
asalib::out << res.size() << '\n';
rep(i, res.size()) asalib::out << res[i] << " \n"[i + 1 == res.size()];
return 0;
}#line 1 "tests/misc/lis/libchecker.test.cpp"
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
using ull = unsigned long long;
#line 2 "library/fastio.hpp"
#line 5 "library/fastio.hpp"
#include <concepts>
#line 11 "library/fastio.hpp"
#include <type_traits>
using namespace std;
// TODO: 何も入力がない場合にも対応する？
namespace asalib {
namespace _internal {
class FastIn {
static constexpr unsigned int BUFFER_SIZE = 1 << 20;
static constexpr unsigned int MAX_TOKEN_SIZE = 64;
array<char, BUFFER_SIZE> read_buffer = {};
array<char, BUFFER_SIZE>::iterator read_ptr = nullptr;
unsigned int read_size = 0;
public:
FastIn() {
read_buffer.fill(0);
read_ptr = read_buffer.begin();
load();
}
private:
void load() {
// まだ読んでないデータを前に持ってくる
memcpy(read_buffer.begin(), read_ptr, read_size - (read_ptr - read_buffer.begin()));
read_size -= read_ptr - read_buffer.begin();
read_ptr = read_buffer.begin();
// stdin から読み込み
read_size += fread(read_buffer.begin() + read_size, 1, BUFFER_SIZE - read_size, stdin);
}
void skip_space() {
// 制御文字 + space
// DEL (127 = 0x7F) がコーナーケースだがまあ使わんやろ
while (*read_ptr <= ' ') ++read_ptr;
}
template<typename T>
requires(integral<T> || is_same_v<T, __int128_t> || is_same_v<T, __uint128_t>)
void _read_uint(T& x) {
x = 0;
while (true) {
uint64_t v;
memcpy(&v, read_ptr, 8);
// '0' -> 0 処理
// こっちを先にやることで制御文字系もはじく
v -= 0x30'30'30'30'30'30'30'30;
// ASCII 範囲外
if (v & 0x80'80'80'80'80'80'80'80) break;
// 桁ごとの数字から数値に
v = (v * 10 + (v >> 8)) & 0x00ff00ff00ff00ff;
v = (v * 100 + (v >> 16)) & 0x0000ffff0000ffff;
v = (v * 10000 + (v >> 32)) & 0x00000000ffffffff;
x = 1'0000'0000 * x + v;
read_ptr += 8;
}
while (true) {
uint32_t v;
memcpy(&v, read_ptr, 4);
v -= 0x30'30'30'30;
if (v & 0x80'80'80'80) break;
v = (v * 10 + (v >> 8)) & 0x00ff00ff;
v = (v * 100 + (v >> 16)) & 0x0000ffff;
x = 1'0000 * x + v;
read_ptr += 4;
}
while (true) {
uint16_t v;
memcpy(&v, read_ptr, 2);
v -= 0x3030;
if (v & 0x8080) break;
v = (v * 10 + (v >> 8)) & 0x00ff;
x = 100 * x + v;
read_ptr += 2;
}
if (*read_ptr > ' ') x = 10 * x + (*read_ptr++ & 0x0f);
}
void read_commonop() {
// そろそろ限界なら読み込み
if ((read_ptr - read_buffer.begin()) + MAX_TOKEN_SIZE >= BUFFER_SIZE) load();
skip_space();
}
public:
FastIn& operator>>(char& x) {
read_commonop();
x = *read_ptr++;
return *this;
}
FastIn& operator>>(string& x) {
read_commonop();
x.clear();
while (*read_ptr > ' ') {
x += *read_ptr++;
if (read_ptr == read_buffer.end()) load();
}
return *this;
}
template<typename T>
requires(integral<T> || is_same_v<T, __int128_t> || is_same_v<T, __uint128_t>)
FastIn& operator>>(T& x) {
read_commonop();
if constexpr (is_signed_v<T> || is_same_v<T, __int128_t>) {
if (*read_ptr == '-') {
++read_ptr;
_read_uint(x);
x = -x;
return *this;
}
}
_read_uint(x);
return *this;
}
};
class FastOut {
static constexpr unsigned int BUFFER_SIZE = 1 << 20;
static constexpr unsigned int MAX_TOKEN_SIZE = 64;
static constexpr unsigned int MAX_PRECOMPUTE_NUM = 1'0000;
static constexpr unsigned int MAX_PRECOMPUTE_NUM_DIGIT = 4;
array<char, BUFFER_SIZE> write_buffer = {};
array<char, BUFFER_SIZE>::iterator write_ptr = nullptr;
public:
FastOut() {
write_buffer.fill(0);
write_ptr = write_buffer.begin();
}
~FastOut() { flush(); }
private:
static constexpr array<char, MAX_PRECOMPUTE_NUM * MAX_PRECOMPUTE_NUM_DIGIT> digits = [] {
array<char, MAX_PRECOMPUTE_NUM * MAX_PRECOMPUTE_NUM_DIGIT> digits {};
for (unsigned int i = 0; i < MAX_PRECOMPUTE_NUM; ++i) {
unsigned int x = i;
for (int j = MAX_PRECOMPUTE_NUM_DIGIT - 1; j >= 0; --j) {
digits[i * MAX_PRECOMPUTE_NUM_DIGIT + j] = '0' + (x % 10);
x /= 10;
}
}
return digits;
}();
template<typename T>
requires(integral<T> || is_same_v<T, __int128_t> || is_same_v<T, __uint128_t>)
static constexpr array<T, numeric_limits<T>::digits10 + 1> Pow10 = [] {
array<T, numeric_limits<T>::digits10 + 1> pow10 {};
pow10[0] = 1;
for (unsigned int i = 1; i < pow10.size(); ++i) pow10[i] = pow10[i - 1] * 10;
return pow10;
}();
void write_commonop() {
// そろそろ限界なら書き込む
if ((write_ptr - write_buffer.begin()) + MAX_TOKEN_SIZE >= BUFFER_SIZE) flush();
}
void putchar(const char& x) { *write_ptr++ = x; }
template<typename T, int NumDig>
requires(integral<T> || is_same_v<T, __int128_t> || is_same_v<T, __uint128_t>)
void _write_uint_top(const T& x) {
// leading-zero を書き込まないようにする
if constexpr (NumDig > 1) {
if (x < Pow10<T>[NumDig - 1]) {
_write_uint_top<T, NumDig - 1>(x);
return;
}
}
copy_n(digits.begin() + (x + 1) * MAX_PRECOMPUTE_NUM_DIGIT - NumDig, NumDig, write_ptr);
write_ptr += NumDig;
}
template<typename T, int NumDig>
requires(integral<T> || is_same_v<T, __int128_t> || is_same_v<T, __uint128_t>)
void _write_uint(const T& x) {
if constexpr (NumDig >= 0) {
if constexpr (NumDig > MAX_PRECOMPUTE_NUM_DIGIT) _write_uint<T, NumDig - MAX_PRECOMPUTE_NUM_DIGIT>(x / MAX_PRECOMPUTE_NUM);
copy_n(digits.begin() + x % MAX_PRECOMPUTE_NUM * MAX_PRECOMPUTE_NUM_DIGIT, MAX_PRECOMPUTE_NUM_DIGIT, write_ptr);
write_ptr += MAX_PRECOMPUTE_NUM_DIGIT;
}
}
template<typename T, int NumDig>
requires(integral<T> || is_same_v<T, __int128_t> || is_same_v<T, __uint128_t>)
void _write_uint_root(const T& x) {
if constexpr (is_same_v<T, __int128_t> || is_same_v<T, __uint128_t>) {
// 128bit 除算はおそいので 64bit 除算を使う
if (x < Pow10<T>[16]) {
_write_uint_root<uint64_t, NumDig>(x);
}
else if (x < Pow10<T>[32]) {
_write_uint_root<uint64_t, NumDig>(x / Pow10<T>[16]);
_write_uint<uint64_t, 16>(x % Pow10<T>[16]);
}
else {
_write_uint_root<uint64_t, NumDig>(x / Pow10<T>[32]);
_write_uint<uint64_t, 16>(x % Pow10<T>[32] / Pow10<T>[16]);
_write_uint<uint64_t, 16>(x % Pow10<T>[16]);
}
return;
}
if constexpr (NumDig < numeric_limits<T>::digits10) {
if (x >= Pow10<T>[NumDig]) {
_write_uint_root<T, NumDig + MAX_PRECOMPUTE_NUM_DIGIT>(x);
return;
}
}
_write_uint_top<T, MAX_PRECOMPUTE_NUM_DIGIT>(x / Pow10<T>[NumDig - MAX_PRECOMPUTE_NUM_DIGIT]);
if constexpr (NumDig > MAX_PRECOMPUTE_NUM_DIGIT) _write_uint<T, NumDig - MAX_PRECOMPUTE_NUM_DIGIT>(x % Pow10<T>[NumDig - MAX_PRECOMPUTE_NUM_DIGIT]);
}
public:
void flush() {
fwrite(write_buffer.begin(), 1, write_ptr - write_buffer.begin(), stdout);
write_ptr = write_buffer.begin();
}
FastOut& operator<<(const char& x) {
write_commonop();
putchar(x);
return *this;
}
FastOut& operator<<(const string& x) {
write_commonop();
unsigned int idx = 0;
while (idx < x.size()) {
const unsigned int siz = min(BUFFER_SIZE - static_cast<unsigned int>(write_ptr - write_buffer.begin()), static_cast<unsigned int>(x.size()) - idx);
copy_n(x.begin() + idx, siz, write_ptr);
write_ptr += siz;
idx += siz;
if (write_ptr == write_buffer.end()) flush();
}
return *this;
}
template<typename T>
requires(integral<T> || is_same_v<T, __int128_t> || is_same_v<T, __uint128_t>)
FastOut& operator<<(const T& x) {
write_commonop();
if constexpr (is_signed_v<T> || is_same_v<T, __int128_t>) {
if (x < 0) {
putchar('-');
_write_uint_root<T, MAX_PRECOMPUTE_NUM_DIGIT>(-x);
return *this;
}
}
_write_uint_root<T, MAX_PRECOMPUTE_NUM_DIGIT>(x);
return *this;
}
};
} // namespace _internal
inline _internal::FastIn in;
inline _internal::FastOut out;
} // namespace asalib
#line 2 "library/misc/lis.hpp"
#line 4 "library/misc/lis.hpp"
#include <ranges>
#line 6 "library/misc/lis.hpp"
using namespace std;
namespace asalib::misc {
template<class T>
vector<int> lis(const vector<T>& a, const bool strict = true) {
vector<T> dp(0);
vector<int> idx(a.size());
for (int i = 0; i < ranges::ssize(a); ++i) {
decltype(ranges::begin(dp)) it;
if (strict)
it = ranges::lower_bound(dp, a[i]);
else
it = ranges::upper_bound(dp, a[i]);
if (it == ranges::end(dp)) {
idx[i] = ranges::ssize(dp);
dp.push_back(a[i]);
}
else {
idx[i] = ranges::distance(ranges::begin(dp), it);
*it = a[i];
}
}
vector<int> res(dp.size());
int j = ranges::ssize(dp) - 1;
for (int i = ranges::ssize(a) - 1; i >= 0; --i) {
if (idx[i] == j) {
res[j] = i, --j;
}
}
return res;
}
} // namespace asalib::misc
#line 9 "tests/misc/lis/libchecker.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/longest_increasing_subsequence"
int main() {
int n;
asalib::in >> n;
vector<int> a(n);
rep(i, n) asalib::in >> a[i];
vector<int> res = asalib::misc::lis(a, true);
asalib::out << res.size() << '\n';
rep(i, res.size()) asalib::out << res[i] << " \n"[i + 1 == res.size()];
return 0;
}