The Heaviest Non-decreasing Subsequence Problem 最长非递减子序列 2017 ACM-ICPC 亚洲区(南宁赛区)网络赛
题目链接根据题意,把值变换成数的个数,这样就变成了求最长非递减子序列,这里用O(n*log(n))的办法#include<bits/stdc++.h>using namespace std;typedef long long ll;const int N =200005;const int INF =1e9+5;ll a;ll v;ll t;vector<ll> num;//LIS