摘要:
已封装: class Left_Heap{ public: static const int Mn = N; int ls[Mn], rs[Mn], rt[Mn], val[Mn], pos[Mn], dis[Mn]; int n; void init(){ for(int i = 1; i <= 阅读全文
摘要:
题目传送门 代码: /* code by: zstu wxk time: 2019/03/01 */ #include<bits/stdc++.h> using namespace std; #define Fopen freopen("testdata.in","r",stdin); freope 阅读全文
摘要:
PS:换了一种方式 希望大家喜欢 2333 /** code by: zstu wxk time: 2019/03/01 Problem Link: http://codeforces.com/contest/1130/problem/E solve: 如果构造的数列是 0 0 0 0 0 0 0 阅读全文