Pagini recente » Cod sursa (job #2987256) | Cod sursa (job #1412976) | Borderou de evaluare (job #3187320) | Cod sursa (job #2006124) | Cod sursa (job #371847)
Cod sursa(job #371847)
#include<fstream.h>
ifstream f("deque.in");
ofstream g("deque.out");
long long v[5000001],k,n,i,s=0;
int p,u,d[5000001];
void deque()
{
p=1;u=0;
for(i=1;i<=n;i++)
{
while(p<=u && v[i]<=v[d[u]])u--;
d[++u]=i;
if(d[p]+k<=i)p++;
if(i>=k)s+=v[d[p]];
}
}
int main()
{
f>>n>>k;
for(i=1;i<=n;i++)
f>>v[i];
deque();
g<<s;
return 0;
}