Cod sursa(job #2400879)
Utilizator | Data | 9 aprilie 2019 10:58:32 | |
---|---|---|---|
Problema | Deque | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
using namespace std;
ifstream fin("deque.in");
ofstream fout("deque.out");
long long s;
int n,k,st,dr,i,a[5000005],c[5000005];
int main()
{
fin >> n >> k;
st=1;
dr=0;
for (i=1;i<=n;i++)
{
fin >> a[i];
while (st<=dr && a[i]<=a[c[dr]]) dr--;
dr++;
c[dr]=i;
if (c[st]==i-k) st++;
if (i>=k) s+=a[c[st]];
}
fout << s;
return 0;
}