Cod sursa(job #717613)
Utilizator | Data | 20 martie 2012 08:25:04 | |
---|---|---|---|
Problema | Deque | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include<fstream>
using namespace std;
int d[5000001];
int main (){
ifstream f("deque.in");
ofstream h("deque.out");
int i,n,k,x=1,y=0,v[5000001];
long long s=0;
f>>n>>k;
for(i=1;i<=n;i++)
f>>v[i];
for(i=1;i<=n;i++)
{
while(x<=y&&v[i]<v[d[y]])y--;
y++;
d[y]=i;
if(d[x]==i-k)x++;
if(i>=k)s+=v[d[x]];
}
h<<s;
return 0;
}