Cod sursa(job #944995)
| Utilizator | Data | 30 aprilie 2013 09:46:49 | |
|---|---|---|---|
| Problema | Deque | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <iostream>
#include <fstream>
#define inf 9999999
using namespace std;
ifstream fin("deque.in");
ofstream fout("deque.out");
int a[5100000],b[5100000];
int st=1,dr,k;
inline void stanga(int i)
{
while(b[st]==i-k)st++;
}
inline void dreapta(int i)
{
while(st<=dr && a[i]<=a[b[dr]])
dr--;
}
int main()
{
long long i,j,n,m,k,s=0;
fin>>n>>k;
for(i=1;i<=n;i++)
fin>>a[i];
for(i=1;i<=n;i++)
{
if(i>k)stanga(i);
dreapta(i);
dr++;
b[dr]=i;
if(i>=k)s+=a[b[st]];
}
fout<<s;
}
