Pagini recente » Cod sursa (job #1407516) | Borderou de evaluare (job #1501450) | Cod sursa (job #1090922) | Cod sursa (job #1990895) | Cod sursa (job #371845)
Cod sursa(job #371845)
#include<fstream.h>
ifstream f("deque.in");
ofstream g("deque.out");
long long v[5000001],d[5000001],p,u,k,n,i,s=0;
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;
}