Cod sursa(job #570093)
Utilizator | Data | 2 aprilie 2011 16:05:13 | |
---|---|---|---|
Problema | Deque | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream>
#define maxn 5000010
using namespace std;
long long v[maxn],q[maxn],n,k;
void citire()
{
int i;
ifstream in("deque.in");
in>>n>>k;
for (i=1;i<=n;i++)
in>>v[i];
}
int main()
{
int i,b=0,f=1,s=0;
citire();
for (i=1;i<=n;i++)
{
while (f<=b&&v[i]<v[q[b]])
b--;
q[++b]=i;
if (q[f]==i-k)
f++;
if (i>=k)
s+=v[q[f]];
}
}