Submission #2049758

---

Source Code Expand

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cmath>
#include <iomanip>
#include <cassert>
#include <bitset>
using namespace std;

typedef pair<int, int> P;
#define rep(i, n) for (int i=0; i<(n); i++)
#define all(c) (c).begin(), (c).end()
#define uniq(c) c.erase(unique(all(c)), (c).end())
#define index(xs, x) (int)(lower_bound(all(xs), x) - xs.begin())
#define _1 first
#define _2 second
#define pb push_back
#define INF 1145141919
#define MOD 1000000007
#define MAX_N (1<<17)

struct SegTree {
  int seg[MAX_N*2-1] = {};
  SegTree() {
    rep(i, MAX_N*2-1) seg[i] = -INF;
  }

  void update(int i, int x) {
    i += MAX_N-1;
    seg[i] = max(seg[i], x);
    while (i > 0) {
      i = (i-1) / 2;
      seg[i] = max(seg[i*2+1], seg[i*2+2]);
    }
  }
  int query(int a, int b, int k=0, int l=0, int r=MAX_N) {
    if (r <= a || b <= l) return 0;
    if (a <= l && r <= b) return seg[k];
    return max(
      query(a, b, k*2+1, l, (l+r)/2),
      query(a, b, k*2+2, (l+r)/2, r)
    );
  }
};

int N, K;
int A[100000];
vector<int> xs;
SegTree seg[101];
signed main() {
  ios::sync_with_stdio(false); cin.tie(0);
  cin >> N >> K;
  vector<int> xs;
  xs.pb(-1);
  rep(i, N) cin >> A[i], xs.pb(A[i]);
  sort(all(xs)); uniq(xs);
  rep(i, N) A[i] = index(xs, A[i]);
  seg[0].update(0, 0);
  rep(i, N) {
    int a = A[i];
    for (int k=K-1; k>=0; k--) seg[k+1].update(a, seg[k].seg[0]+1);
    for (int k=K; k>=0; k--) seg[k].update(a, seg[k].query(0, a)+1);
  }
  int m = 0;
  rep(i, K+1) m = max(m, seg[i].seg[0]);
  cout << m << "\n";
  return 0;
}

Submission Info

Judge Result