摘要： http://acm.fzu.edu.cn/problem.php?pid=1894 简单单调队列。code:#include<cstdio>intdata[1000001];intqueue[1000001];intnum[1000001];inth,r,n;voidinsert(){if(r==h-1||data[n]<queue[r]){r++;queue[r]=data[n];num[r]=n;}else{while(r>=h&&data[n]>=queue[r])r--;queue[++r]=data[n];num[r]=n;}}void 阅读全文