摘要：
复杂度O(NlogN) 求逆序对： #include<iostream> #include<cstdio> #include<string> #include<algorithm> #include<queue> #include<deque> #include<set> #include<map> 阅读全文
posted @ 2020-02-12 18:08
MQFLLY
阅读(100)
评论(0)
推荐(0)
摘要：
inline int read() { char ch, c=' '; int res; while (ch = getchar(), ch < '0' || ch>'9') c = ch; res = ch - 48; while (ch = getchar(), ch >= '0' && ch 阅读全文
posted @ 2020-02-12 14:23
MQFLLY
阅读(143)
评论(0)
推荐(0)
浙公网安备 33010602011771号