HDU 4000 Fruit Ninja 树状数组
摘要：
求逆序对的加强版.先求出 x#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;typedef long long ll;typedef unsigned long long ull;typedef pair pii;#define pb(a) push_back(a)#define INF 0x1f1f1f1f#define lson idx T min(const T& a,const T 阅读全文
posted @ 2013-11-21 20:52 BMan、 阅读(179) 评论(0) 推荐(0)
浙公网安备 33010602011771号