Cod sursa(job #1506501)
| Utilizator | Data | 20 octombrie 2015 19:02:45 | |
|---|---|---|---|
| Problema | Deque | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("deque.in");
ofstream g("deque.out");
int a[50000001],deq[50000001],k,n;
long long suma;
int main()
{
f>>n>>k;
int i,prim=1,ultim=0;
for(i=1;i<=n;i++)
f>>a[i];
for(i=1;i<=n;i++)
{
while(a[i]<=a[deq[ultim]] && prim<=ultim)
ultim--;
ultim++;
deq[ultim]=i;
if(deq[prim]<=i-k)
prim++;
if(i>=k)
suma+=a[deq[prim]];
}
g<<suma;
return 0;
}
