Cod sursa(job #570202)
Utilizator | Andrei Ilisei tinky | Data | 2 aprilie 2011 18:30:23 |
---|---|---|---|
Problema | Secventa | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.43 kb |
#include<fstream>
#define maxn 5000010
using namespace std;
int 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;
long long 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]];
}
ofstream out("deque.out");
out<<s<<'\n';
}