test/verify/aoj-dpl-1-d.test.cpp

• View this file on GitHub
• Last update: 2024-04-24 02:34:04+09:00
• Problem: http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DPL_1_D

Depends on

• Longest Increasing Subsequence(最長増加部分列) (dp/longest-increasing-subsequence.hpp)
• template/template.hpp

Code

// competitive-verifier: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DPL_1_D

#include "../../template/template.hpp"

#include "../../dp/longest-increasing-subsequence.hpp"

int main() {
  int N;
  cin >> N;
  vector< int > A(N);
  cin >> A;
  cout << longest_increasing_subsequence(A, true) << endl;
}

#line 1 "test/verify/aoj-dpl-1-d.test.cpp"
// competitive-verifier: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DPL_1_D

#line 1 "template/template.hpp"
#include<bits/stdc++.h>

using namespace std;

using int64 = long long;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;

template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 >& p) {
  os << p.first << " " << p.second;
  return os;
}

template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
  is >> p.first >> p.second;
  return is;
}

template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
  for(int i = 0; i < (int) v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
  for(T &in : v) is >> in;
  return is;
}

template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

template< typename T = int64 >
vector< T > make_v(size_t a) {
  return vector< T >(a);
}

template< typename T, typename... Ts >
auto make_v(size_t a, Ts... ts) {
  return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));
}

template< typename T, typename V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
  t = v;
}

template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
  for(auto &e : t) fill_v(e, v);
}

template< typename F >
struct FixPoint : F {
  explicit FixPoint(F &&f) : F(forward< F >(f)) {}

  template< typename... Args >
  decltype(auto) operator()(Args &&... args) const {
    return F::operator()(*this, forward< Args >(args)...);
  }
};
 
template< typename F >
inline decltype(auto) MFP(F &&f) {
  return FixPoint< F >{forward< F >(f)};
}
#line 4 "test/verify/aoj-dpl-1-d.test.cpp"

#line 1 "dp/longest-increasing-subsequence.hpp"
template< typename T >
size_t longest_increasing_subsequence(const vector< T > &a, bool strict) {
  vector< T > lis;
  for(auto &p : a) {
    typename vector< T >::iterator it;
    if(strict) it = lower_bound(begin(lis), end(lis), p);
    else it = upper_bound(begin(lis), end(lis), p);
    if(end(lis) == it) lis.emplace_back(p);
    else *it = p;
  }
  return lis.size();
}
#line 6 "test/verify/aoj-dpl-1-d.test.cpp"

int main() {
  int N;
  cin >> N;
  vector< int > A(N);
  cin >> A;
  cout << longest_increasing_subsequence(A, true) << endl;
}

Test cases

Env	Name	Status	Elapsed	Memory
g++	00_sample_00.in	AC	6 ms	4 MB
g++	00_sample_01.in	AC	6 ms	4 MB
g++	01_small_00.in	AC	6 ms	4 MB
g++	01_small_01.in	AC	6 ms	4 MB
g++	01_small_02.in	AC	6 ms	4 MB
g++	01_small_03.in	AC	6 ms	4 MB
g++	01_small_04.in	AC	6 ms	4 MB
g++	01_small_05.in	AC	6 ms	4 MB
g++	01_small_06.in	AC	6 ms	4 MB
g++	01_small_07.in	AC	6 ms	4 MB
g++	02_rand_00.in	AC	6 ms	4 MB
g++	02_rand_01.in	AC	6 ms	4 MB
g++	02_rand_02.in	AC	6 ms	4 MB
g++	02_rand_03.in	AC	6 ms	4 MB
g++	03_linear_00.in	AC	6 ms	4 MB
g++	03_linear_01.in	AC	6 ms	4 MB
g++	03_linear_03.in	AC	6 ms	4 MB
g++	03_linear_04.in	AC	6 ms	4 MB
g++	04_critical_00.in	AC	7 ms	4 MB
g++	04_critical_01.in	AC	6 ms	4 MB
g++	04_critical_02.in	AC	6 ms	4 MB
g++	04_critical_03.in	AC	6 ms	4 MB
g++	05_maximum_00.in	AC	9 ms	4 MB
g++	05_maximum_01.in	AC	10 ms	4 MB
g++	05_maximum_02.in	AC	12 ms	4 MB
g++	05_maximum_03.in	AC	14 ms	4 MB
g++	05_maximum_04.in	AC	14 ms	4 MB
g++	05_maximum_05.in	AC	16 ms	4 MB
g++	05_maximum_06.in	AC	15 ms	4 MB
g++	05_maximum_07.in	AC	12 ms	4 MB
clang++	00_sample_00.in	AC	6 ms	4 MB
clang++	00_sample_01.in	AC	6 ms	4 MB
clang++	01_small_00.in	AC	6 ms	4 MB
clang++	01_small_01.in	AC	6 ms	4 MB
clang++	01_small_02.in	AC	6 ms	4 MB
clang++	01_small_03.in	AC	6 ms	4 MB
clang++	01_small_04.in	AC	6 ms	4 MB
clang++	01_small_05.in	AC	6 ms	4 MB
clang++	01_small_06.in	AC	6 ms	4 MB
clang++	01_small_07.in	AC	6 ms	4 MB
clang++	02_rand_00.in	AC	5 ms	4 MB
clang++	02_rand_01.in	AC	6 ms	4 MB
clang++	02_rand_02.in	AC	6 ms	4 MB
clang++	02_rand_03.in	AC	6 ms	4 MB
clang++	03_linear_00.in	AC	6 ms	4 MB
clang++	03_linear_01.in	AC	6 ms	4 MB
clang++	03_linear_03.in	AC	6 ms	4 MB
clang++	03_linear_04.in	AC	6 ms	4 MB
clang++	04_critical_00.in	AC	6 ms	4 MB
clang++	04_critical_01.in	AC	6 ms	4 MB
clang++	04_critical_02.in	AC	6 ms	4 MB
clang++	04_critical_03.in	AC	6 ms	4 MB
clang++	05_maximum_00.in	AC	9 ms	4 MB
clang++	05_maximum_01.in	AC	10 ms	4 MB
clang++	05_maximum_02.in	AC	10 ms	4 MB
clang++	05_maximum_03.in	AC	11 ms	4 MB
clang++	05_maximum_04.in	AC	12 ms	4 MB
clang++	05_maximum_05.in	AC	14 ms	4 MB
clang++	05_maximum_06.in	AC	15 ms	4 MB
clang++	05_maximum_07.in	AC	12 ms	4 MB

Back to top page