keepcoral的博客

Longest Ordered SubsequenceTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 59128 Accepted: 26487DescriptionA numeric sequence of ai is ordered if a1 < a2 < ... < aN. Let the subsequ...

#include<cstdio> #include<algorithm> #include<iostream> using namespace std; const int maxn = 211111; int y[maxn]; int stack[maxn]; struct node { int x; int y; } a[100009]; i...

#include <iostream> #include <cstring> #include <cmath> #include <algorithm> #include <cstdio> #include <stack> using namespace std; struct node { int w; i...