Cod sursa(job #1831011)
Utilizator | Data | 17 decembrie 2016 12:29:54 | |
---|---|---|---|
Problema | Deque | Scor | 25 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
#define nmax 5000001
using namespace std;
ifstream fin("deque.in");
ofstream fout("deque.out");
int n,k,v[nmax],d[nmax],st=1,dr,sum;
inline void stanga(int i)
{
if(i-d[st]==k)
st++;
}
inline void dreapta(int i)
{
while(st<=dr && v[i]<=v[d[dr]])
dr--;
d[++dr]=i;
}
int main()
{
int i;
fin>>n>>k;
for(i=1;i<=n;i++)
{
fin>>v[i];
stanga(i);
dreapta(i);
if(i>=k)
sum+=v[d[st]];
}
fout<<sum;
return 0;
}