Cod sursa(job #2544205)
Utilizator | Data | 11 februarie 2020 20:47:22 | |
---|---|---|---|
Problema | Deque | Scor | 25 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
#define dim 5000010
using namespace std;
int a[dim];
int d[dim];
int i,n,k,p,u,s;
int main() {
ifstream fin("deque.in");
ofstream fout("deque.out");
fin>>n>>k;
for (i=1;i<=n;i++) {
fin>>a[i];
}
p=1;
for (i=1;i<=n;i++) {
while (p<=u&&a[i]<a[d[u]]) u--;
d[++u]=i;
if (i-d[p]+1==k+1) p++;
if (i>=k) s+=a[d[p]];
}
fout<<s;
return 0;
}