Cod sursa(job #1346393)
| Utilizator | Data | 18 februarie 2015 11:11:42 | |
|---|---|---|---|
| Problema | Deque | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <iostream>
#include <fstream>
#define N 5000002
using namespace std;
int dq[N];
int st,dr,n,k;
int a[N];
long long sol;
int main()
{
ifstream fin("deque.in");
fin>>n>>k;
int i;
for(i=1; i<=n; i++)
fin>>a[i];
st=1; dr=0;
sol=0;
for(i=1; i<=n; i++)
{
while(st<=dr && a[dq[dr]]>=a[i]) dr--;
dq[++dr]=i;
if(dq[st]==i-k) st++;
if(i>=k) sol+=a[dq[st]];
}
ofstream fout("deque.out");
fout<<sol<<" ";
return 0;
}
