Pagini recente » Cod sursa (job #3129880) | Cod sursa (job #28728) | Cod sursa (job #1090442) | Cod sursa (job #2195949) | Cod sursa (job #268490)
Cod sursa(job #268490)
#include<stdio.h>
#define N 5000010
long d[N],val,sol;
int n,k,x[N],p,u,i;
void readd(),solve();
int main()
{
readd();
solve();
return 0;
}
void readd()
{
freopen("deque.in","r",stdin);
freopen("deque.out","w",stdout);
scanf("%d%d", &n,&k);
}
void solve()
{
p=1;
for(i=1;i<k;i++)
{
scanf("%ld", &val);
while(p<=u&&val<=d[u])u--;
u++;d[u]=val;x[u]=i;
}
for(i=k;i<=n;i++)
{
scanf("%ld",&val);
if(i-x[p]==k)p++;
while(p<=u && val<=d[u])u--;
u++;d[u]=val;x[u]=i;
sol+=d[p];
}
printf("%ld\n",sol);
}