如題。用了三天……主要還是因為太懶，以後codeforces(div.2)或(div.1 + div2)只要參加了就寫個題解。

放上我的程式碼格式，是用杜老師的%%%

#include <iostream> #include <cstdio> #include <algorithm> #include <cstring> #define rep(x, l, r) for(int x = (int)l; x <= (int)r; x++) #define repd(x, r, l) for(int x = (int)r; x >= (int)l; x--) #define clr(x,y) memset(x, y, sizeof(x)) #define mp(x, y) make_pair(x, y) #define all(x) begin(x), end(x) #define MAXN #define fi first #define se second; #define Size(x) ((int)size(x)) using namespace std; typedef long long LL; typedef vector<int> vi; typedef pair<int, int> pii; const int INF = 1 << 30; const int p = 10000007; //head by DYH
int main(){   return 0; }