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