Cod sursa(job #1786523)
| Utilizator | Data | 23 octombrie 2016 10:50:39 | |
|---|---|---|---|
| Problema | Deque | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
#define DMAX 5000001
using namespace std;
ifstream f("Due.in");
ofstream g("Due.out");
long long sum;
int n, k , st ,dr , D[DMAX] , a[DMAX];
int main()
{ f>>n>>k;
int i;
st=1 ; dr=0;
for(i=1 ; i<=n ; i++) f>>a[i];
for(i=1 ; i<=n ; i++)
{ while(st <= dr && a[i] <= a[D[dr]]) dr--;
D[++dr]=i;
if(D[st]<=i-k) st++;
if(i >= k) sum+=a[D[st]];
}
g<<sum;
return 0;
}
