The Heaviest Non-decreasing Subsequence Problem 2017 ACM-ICPC 亚洲区（南宁赛区）网络赛 常见问题

本来是个裸的线段树的题

但是把负数删掉，权重为5 的点，赋值5遍放到队列里

这样问题就转化成了求最长上升（非下降）子序列

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <set>
#include <queue>
#include <algorithm>
#include <vector>
#include <cctype>
#include <stack>
#include <sstream>
#include <list>
#include <map>
#include <assert.h>
#define debug() puts("************")
#define MS(a,b) memset(a,b,sizeof a)
using namespace std;

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int,int> P;
//const int INF = 0x3f3f3f3f;
const double inf = 1e20;
const double PI = 3.1415926535;
const double eps = 1e-9;
const LL mod = 1e9+7;
const int dx[] = {-1,0,1,0};
const int dy[] = {0,1,0,-1};

const int maxn = 1000000 + 7;
const LL INF = 0x3f3f3f3f3f3f3f3f;
LL b[maxn];

vector<LL> vec;

int main() {

    LL x;
    while(~scanf("%lld", &x)) {
        if(x < 0) continue;
        else if(x >= 10000) {
           x -= 10000;
           for(int i = 0; i < 5; ++i)
            vec.push_back(x); //cnt++;

        }
        else {
            vec.push_back(x);//cnt++;
        }
    }
    int n = vec.size();

    //for(int i = 0; i < n; ++i)
    //    cout << vec[i] << " ";

    memset(b, INF, sizeof b);
    for(int i = 0; i < n; ++i) {
        //if(a[i] < 0)
        *upper_bound(b, b+n, vec[i])  = vec[i];
    }
    int ans = lower_bound(b, b+n, INF) - b;
    cout << ans << endl;
    return 0;
}


/*
80 75 73 93 73 73 10101 97 -1 -1 114 -1 10113 118
*/