Cod sursa(job #393594)
Utilizator | Gheorghita Daniel ghedany92 | Data | 9 februarie 2010 18:24:15 |
---|---|---|---|
Problema | Deque | Scor | 25 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream.h>
ifstream fin("deque.in");
ofstream fout("deque.out");
long a[5000001],c[5000001],n,m,inc,sf,i,s;
int main()
{
fin>>n>>m;
inc=1;sf=0;
for (i=1;i<=n;i++)
fin>>a[i];
for (i=1;i<=n;i++)
{
while (inc<=sf && a[i]<=a[c[sf]]) sf--;
sf++;
c[sf]=i;
if (c[inc]==i-m) inc++;
if (i>=m) s+=a[c[inc]];
}
fout<<s;
fout.close();
return 0;
}