Cod sursa(job #1053106)
| Utilizator | Data | 12 decembrie 2013 11:18:35 | |
|---|---|---|---|
| Problema | Deque | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <iostream>
#include<fstream>
#define nmax 5000001
using namespace std;
int deq[nmax],v[nmax];
int main()
{
int st=1,dr=0,n,i,k;
long long s=0;
ifstream fin("deque.in");
ofstream fout("deque.out");
fin>>n>>k;
for(i=1;i<=n;i++)
fin>>v[i];
for(i=1;i<=n;i++)
{
while(st<=dr&&v[deq[dr]]>=v[i])
dr--;
deq[++dr]=i;
while(deq[st]<=i-k)
st++;
if(i>=k)
s+=v[deq[st]];
}
fout<<s;
return 0;
}
