Cod sursa(job #1277102)
Utilizator | Cezar Mihalcea Cezar_Mihalcea | Data | 27 noiembrie 2014 09:40:59 |
---|---|---|---|
Problema | Deque | Scor | 25 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include<fstream>
using namespace std;
int st,dr,dq[5000000],v[5000000],k,n;
void stanga(int i)
{
if(i-dq[st]==k)
st++;
}
void dreapta(int i)
{
while(st<=dr && v[i]<=v[dq[dr]])
dr--;
dq[++dr]=i;
}
int main()
{
ifstream f("deque.in");
ofstream g("deque.out");
int i,s=0;
f>>n>>k;
for(i=1;i<=n;i++)
f>>v[i];
for(i=1;i<=n;i++)
{
dreapta(i);
stanga(i);
if(i>=k)
s=s+v[dq[st]];
}
g<<s;
return 0;
}