数据结构
Glory_g
明日之我胸中有沟壑,立马振山河
展开
-
HDU 1025
不管你用什么东西 只要能把最大上升子序列的复杂度降到 (nlogn) 就行#include <iostream> #include <cstring> #include <algorithm> #include <cmath> using namespace std;const int maxn = 5e5 + 10; int a[maxn] = {0}; int d[maxn] = {0}; in原创 2017-10-07 20:33:26 · 214 阅读 · 0 评论 -
Codeforces Round #447 (Div. 2) D. Ralph And His Tour in Binary Country
#include <iostream> #include <algorithm> #include <cstring> #include <cstdio> #include <set> #include <vector> #define ll long long using namespace std;const int maxn = 1e6 + 10; ll len[maxn] = {0}; ve原创 2017-11-20 23:40:39 · 210 阅读 · 0 评论