Cod sursa(job #2374648)
| Utilizator | Data | 7 martie 2019 19:48:08 | |
|---|---|---|---|
| Problema | Deque | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
#define Nmax 5000005
using namespace std;
ifstream fin ("deque.in");
ofstream fout ("deque.out");
int a[Nmax], d[Nmax], i, n, k, fata, spate;
long long s;
int main()
{
fin >> n >> k;
for(i=1;i<=n;i++)
fin >> a[i];
fata=1;
for(i=1;i<=n;i++)
{
while(fata<=spate&&a[i]<=a[d[spate]])
spate--;
d[++spate]=i;
if(d[fata]==i-k)
fata++;
if(i>=k)
s+=a[d[fata]];
}
fout << s;
return 0;
}
