Cod sursa(job #1934639)
Utilizator | Data | 21 martie 2017 18:13:32 | |
---|---|---|---|
Problema | Deque | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
using namespace std;
ifstream f("deque.in");
ofstream g("deque.out");
int v[5000010],n,k,c[5000010],p,u,i;
long long s;
int main()
{
f>>n>>k;
for(i=1;i<=n;i++)
{
f>>v[i];
}
p=u=0;
s=0;
for(i=1;i<=n;i++)
{
while(v[i]<v[c[u]] && p<=u)
{
u--;
}
c[++u]=i;
if(i-k>=c[p])
{
p++;
}
if(i>=k)
s+=v[c[p]];
}
g<<s;
return 0;
}