P1020 导弹拦截

洛谷的一题线性dp题，spoj题
题意为求一个最长不上升子序列和最长上升子序列
dp很容易搞定平方的复杂度

#define judge
#include <bits/stdc++.h>
using namespace std;
int n;
const int inf = 0x3f3f3f3f;
const int maxn = 1e5 + 10;
int a[maxn];
int dp[maxn];
void solve() {
  //最长不上升子序列要从后向前搞
  int res = -inf;
  for (int i = n; i >= 1; i--) {
    dp[i] = 1;
    for (int j = i + 1; j <= n; j++) {
      if (a[j] <= a[i]) {
        dp[i] = max(dp[i], dp[j] + 1);
      }
    }
    res = max(res, dp[i]);
  }
  cout << res << endl;

  int res1 = -inf;
  for (int i = 1; i <= n; i++) {
    dp[i] = 1;
    for (int j = 1; j < i; j++) {
      if (a[j] < a[i]) {  //
        dp[i] = max(dp[i], dp[j] + 1);
      }
    }
    res1 = max(res, dp[i]);
  }
  cout << res1 << endl;
}

int main(int argc, char const *argv[]) {
#ifndef judge
  freopen("data.in", "r", stdin);
  freopen("data.out", "w", stdout);
#endif
  int i = 1;
  while (~scanf("%d", &a[i++])) {
  }
  i -= 2;
  n = i;

  solve();
  return 0;
}

---

题解源地址

看了两个nlgn的题解，尤其是upper_bound和lower_bound来实现的，很惊叹QAQ。下面是大佬代码

#include <algorithm>
#include <iostream>
using namespace std;
const int N = 100010;
int a[N], d1[N], d2[N], n;
int main() {
  while (cin >> a[++n])
    ;
  n--;                     //输入
  int len1 = 1, len2 = 1;  //初始长度为1
  d1[1] = a[1];            //用于求不上升序列长度
  d2[1] = a[1];            //用于求上升序列长度
  for (int i = 2; i <= n; i++) {  //从a[2]开始枚举每个数(a[1]已经加进去了)
    if (d1[len1] >= a[i])
      d1[++len1] = a[i];  //如果满足要求(不上升)就加入d1
    else {                //否则用a[i]替换d1中的一个数
      int p1 = upper_bound(d1 + 1, d1 + 1 + len1, a[i], greater<int>()) - d1;
      d1[p1] = a[i];
    }
    if (d2[len2] < a[i])
      d2[++len2] = a[i];  //同上
    else {
      int p2 = lower_bound(d2 + 1, d2 + 1 + len2, a[i]) - d2;
      d2[p2] = a[i];
    }
  }
  cout << len1 << endl << len2;  
  return 0;        
}

---

然后是树状数组的解法

//树状数组的做法
//时间复杂度onlgn
#include <bits/stdc++.h>
    using namespace std;
int f[1000000];
int z[1000000];
int lowbit(int x) { return x & -x; }
int big;
inline int ask(int x) {  //这是用来求单调上升子序列的
  int r = 0;
  for (int i = x; i > 0; i -= lowbit(i)) r = max(r, f[i]);
  return r;
}
inline void add(int x, int v) {  //这也是用来求单调上升子序列的
  for (int i = x; i <= big; i += lowbit(i)) f[i] = max(f[i], v);
}
inline int que(int x) {  //这是用来求最长单调不升子序列的
  int r = 0;
  for (int i = x; i <= big; i += lowbit(i)) r = max(r, f[i]);
  return r;
}
inline void psh(int x, int v) {  //这也是用来求最长单调不升子序列的
  for (int i = x; i > 0; i -= lowbit(i)) f[i] = max(f[i], v);
}
int tot;
int a[1000000];
int ans;
int main() {
  tot = 1;
  while (scanf("%d", &a[tot]) != EOF) {
    big = max(big, a[tot]);
    z[tot] = a[tot];
    tot++;
  }
  tot--;  //读入并统计个数
  for (int i = 1; i <= tot;
       i++) {  //求最长单升子序列，树状数组中保存的是0~a[i]的最大值
    int x = ask(a[i]) + 1;
    ans = max(ans, x);
    add(a[i] + 1, x);  //因为是严格单升所以这里要+1
  }
  memset(f, 0, sizeof(f));  //清空树状数组，用来求下面的不降子序列
  int num = 0;
  for (int i = 1; i <= tot;
       i++)  //求最长不降子序列，树状数组里存的是a[i]~inf的最大值
  {
    int x = que(a[i]) + 1;
    num = max(num, x);
    psh(a[i], x);  //因为是不升而不是严格单降所以不用-1或+1
  }
  printf("%d\n%d", num, ans);
  return 0;
}