摘要：因为一个变化只会变化一个值，所以 $dp[i]=max(dp[j])+1,j include using namespace std; int n, m, zdz[100005], zxz[100005], a[100005], uu, vv, cnt, dp[100005], ans, rot[1 阅读全文

摘要：```cpp include include include include using namespace std; int n, m, a[50005], opt, uu, vv, ww, ans; const int oo=2147483647; namespace treap{ struct 阅读全文