Arrangement for Contests

题目链接：Arrangement for Contests

#pragma GCC optimize("-Ofast","-funroll-all-loops")
#include<bits/stdc++.h>
//#define int long long
using namespace std;
const int N=1e5+10;
int mi[N<<2],n,k,lazy[N<<2];    long long res;
#define mid (l+r>>1)
inline void push_down(int p){if(!lazy[p])   return ;lazy[p<<1]+=lazy[p],lazy[p<<1|1]+=lazy[p];mi[p<<1]-=lazy[p],mi[p<<1|1]-=lazy[p];lazy[p]=0;
}
void build(int p,int l,int r){lazy[p]=0;if(l==r){scanf("%d",&mi[p]);   return ;}build(p<<1,l,mid),build(p<<1|1,mid+1,r);mi[p]=min(mi[p<<1],mi[p<<1|1]);
}
void change(int p,int l,int r,int ql,int qr,int v){if(l==ql&&r==qr){mi[p]-=v,lazy[p]+=v; return ;}push_down(p);if(qr<=mid)   change(p<<1,l,mid,ql,qr,v);else if(ql>mid) change(p<<1|1,mid+1,r,ql,qr,v);else change(p<<1,l,mid,ql,mid,v),change(p<<1|1,mid+1,r,mid+1,qr,v);mi[p]=min(mi[p<<1],mi[p<<1|1]);
}
int ask(int p,int l,int r,int ql,int qr){if(l==ql&&r==qr)   return mi[p];push_down(p);if(qr<=mid)   return ask(p<<1,l,mid,ql,qr);else if(ql>mid)   return ask(p<<1|1,mid+1,r,ql,qr);else return min(ask(p<<1,l,mid,ql,mid),ask(p<<1|1,mid+1,r,mid+1,qr));
}
inline void solve(){cin>>n>>k;  res=0; build(1,1,n);for(int i=k;i<=n;i++){int val=ask(1,1,n,i-k+1,i); res+=val;change(1,1,n,i-k+1,i,val);}printf("%lld\n",res);
}
signed main(){int T;    cin>>T;   while(T--)  solve();return 0;
}

Arrangement for Contests相关推荐

Bottles Arrangement
Bottles Arrangement Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) ...
LeetCode 526. Beautiful Arrangement
526. Beautiful Arrangement Suppose you have N integers from 1 to N. We define a beautiful arrangemen ...
AOAPC I: Beginning Algorithm Contests 题解
AOAPC I: Beginning Algorithm Contests 题解 AOAPC I: Beginning Algorithm Contests (Rujia Liu) - Virtual ...
MM配额协议（Quota Arrangement）-阿龙学习MM PA 笔记（3）
MM配额协议(Quota Arrangement)-阿龙学习MM PA 笔记(3) 欢迎关注公众号"SAP顾问之路"获取SAP PA官方教材及培训视频,加官方QQ群:3169922 ...
LeetCode笔记：526. Beautiful Arrangement
问题: Suppose you have N integers from 1 to N. We define a beautiful arrangement as an array that is c ...
【Leetcode】526. Beautiful Arrangement
Description: Suppose you have N integers from 1 to N. We define a beautiful arrangement as an array ...
团体程序设计天梯赛 https://www.patest.cn/contests/gplt
https://www.patest.cn/contests/gplt 代码: L2-21 //#include<iostream> //#include<cstdio> // ...
CF908D New Year and Arbitrary Arrangement
题意给定三个数\(k\),\(pa\),\(pb\) 每次有\(\frac{pa}{pa+pb}\) 的概率往后面添加一个'\(a\)' 每次有\(\frac{pb}{pa+pb}\)的概率往后面添 ...
hdu 4109 Instrction Arrangement 拓扑排序关键路径
这个算是关键路径的模版题目了,解这个题目之前,首先说下关键路径的含义,传送门(度娘),个人的见解是,关键路径就是木桶的短板问题,比如有一群人约好去某个地方,大家从同一个地方同一时间开始出发,有些人选择 ...

Arrangement for Contests

题目链接：Arrangement for Contests

Arrangement for Contests相关推荐

最新文章

热门文章