Lang:G++
Edit12345678910111213141516171819202122232425262728293031#include <iostream>#include <algorithm>#include <cstdio>#include <cstdlib>//哎呦我的上帝啊,,今天要写的这一起hihocoder的代码听说只有五行,但是复杂度是O(N^3)啊。。。。。。using namespace std;/***Thx**//***常驻数据介绍*i : sweet i, unique and vital.*ll : strict ll and Set.*//***变量声明区*/#define lchild rt << 1 , l , m#define rchild rt << 1 | 1 , m + 1 , rconst int maxn = 1000000;int tree[maxn<<2];int DataSuitCount = 0;int dataCount = 0;