传送门
可以搞2个单调队列。
然后，然后就没有然后了。
1 # include <iostream> 2 # include <cstdio> 3 # include <cstring> 4 # include <string> 5 # include <cmath> 6 # include <vector> 7 # include <map> 8 # include <queue> 9 # include <cstdlib> 10 # define MAXN 1000001 11 using namespace std; 12 13 inline int get_num() 20 21 int n, k, h1 = 1, t1, h2 = 1, t2; 22 int a[MAXN], q1[MAXN], q2[MAXN], ans1[MAXN], ans2[MAXN]; 23 24 int main() 25 41 for(i = k; i <= n; i++) printf("%d ", ans1[i]); 42 puts(""); 43 for(i = k; i <= n; i++) printf("%d ", ans2[i]); 44 puts(""); 45 return 0; 46 }View Code
完全临摹黄学长代码2333
上一篇：[bzoj1787][Ahoi2008]Meet 紧急集合（lca）
下一篇：[POJ2446] Chessboard（二分图最大匹配-匈牙利算法）
单调队列
