Cod sursa(job #1624424)
Utilizator | Data | 2 martie 2016 10:56:14 | |
---|---|---|---|
Problema | Deque | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
ifstream f("deque.in");
ofstream g("deque.out");
int n,k,u,p,i,deq[5000005],v[5000005];
long long s;
int main()
{
f>>n>>k;
for(i=1;i<=n;i++)
f>>v[i];
for(i=1;i<=n;i++)
{
while(p<=u&&v[i]<=v[deq[u]])
u--;
deq[++u]=i;
if(deq[p]==i-k)
p++;
if(i>=k)
s=s+v[deq[p]];
}
g<<s;
return 0;
}