[算法竞赛入门经典]UVa 1471 Defense Lines 详细注解 P377

题目context真傻逼欸，还有拆塔加强防御的

https://cn.vjudge.net/problem/UVA-1471 

 O(nlogn)

// https://github.com/aoapc-book/aoapc-bac2nd/blob/master/ch8/UVa1471.cpp
// UVa1471 Defense Lines
// Rujia Liu
// Algorithm 1: use STL set to maintain the candidates.
// This is a little bit more intuitive, but less efficient (than algorithm 2)
#include<cstdio>
#include<set>
#include<cassert>
using namespace std;

const int maxn = 200000 + 5;
// a[i] 数组i位置的值
// f[i] 以i开头的最长递增数组的长
// g[i] 以i结尾的最长递增数组的长
int n, a[maxn], f[maxn], g[maxn];

struct Candidate {
  int a, g;
  Candidate(int a, int g):a(a),g(g) {}
  // set中元素是否相等，只看两者a是否相等，与g无关
  bool operator < (const Candidate& rhs) const {
    return a < rhs.a;
  }
};

set<Candidate> s;

int main() {
  int T;
  scanf("%d", &T);
  while(T--) {
    scanf("%d", &n);
    for(int i = 0; i < n; i++)
      scanf("%d", &a[i]);
    if(n == 1) { printf("1\n"); continue; }

    // g[i] 以i结尾的最长递增数组的长   
    g[0] = 1;
    for(int i = 1; i < n; i++)
      if(a[i-1] < a[i]) g[i] = g[i-1] + 1;
      else g[i] = 1;

    // f[i] 以i开头的最长递增数组的长
    f[n-1] = 1;
    for(int i = n-2; i >= 0; i--)
      if(a[i] < a[i+1]) f[i] = f[i+1] + 1;
      else f[i] = 1;

    s.clear();
    s.insert(Candidate(a[0], g[0]));
    int ans = 1;
    for(int i = 1; i < n; i++) {
      Candidate c(a[i], g[i]);
      // set为有序
      // it-1 为最后一个<=c的set中的元素
      set<Candidate>::iterator it = s.lower_bound(c); // first one that is >= c
      bool keep = true;
      if(it != s.begin()) {
        Candidate last = *(--it); // (--it) points to the largest one that is < c
        int len = f[i] + last.g; 
        ans = max(ans, len);
        // c.a >= last.a 但是 c.g <= last.g 肯定不用加入set
        if(c.g <= last.g) keep = false;
      }

      if(keep) {
        // 删除和c.a相同的那个元素，旧的c.g 肯定<= 新的c.g（63行决定） 
        s.erase(c); // if c.a is already present, the old g must be <= c.g
        s.insert(c);
        it = s.find(c); // this is a bit cumbersome and slow but it's clear
        it++;
        // 删除所有值比c.a大，g还比c.g短的元素(此时i相同)
        while(it != s.end() && it->a > c.a && it->g <= c.g) s.erase(it++);
      }
    }
    printf("%d\n", ans);
  }
  return 0;
}