![](https://img-blog.csdnimg.cn/20201014180756916.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
单调队列
Change_ZHONG
成在坚持
展开
-
tjut 5289
#include #include using namespace std;typedef __int64 ll;int n, k;int a[100005], qmax[100005], qmin[100005];void gao() { ll ans = 0; int maxf, maxr, minf, minr; maxf = maxr = min原创 2016-06-03 17:26:43 · 182 阅读 · 0 评论 -
tjut 3530
#include struct mart { double mat[105][105]; }; mart kk,xx; int n; mart multi(mart a,mart b) { mart c; int i,j,k; for(i=1;i<=n;i++) for(j=1;j<=n;j原创 2016-08-31 08:55:51 · 154 阅读 · 0 评论 -
tjut 3474
#include #include #include #define MAXN 1000005 #define min(a, b) ((a)<=(b)?(a):(b)) using namespace std; int num[MAXN]; char ans[MAXN]; char s[MAXN]; int l[MAXN]; int r[M原创 2016-08-23 10:24:31 · 135 阅读 · 0 评论