Cod sursa(job #2140443)
Utilizator | Data | 23 februarie 2018 15:07:50 | |
---|---|---|---|
Problema | Deque | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
using namespace std;
ifstream fin("deque.in");
ofstream fout("deque.out");
int n,i,v[5000010],s[20000000],p,u,k,sum;
int main () {
fin>>n>>k;
for (i=1;i<=n;i++)
fin>>v[i];
p=1;
u=0;
for (i=1;i<=n;i++) {
while (p<=u && v[i]<v[s[u]])
u--;
u++;
s[u]=i;
if (i-s[p]==k) {
sum=sum+v[s[p]];
p++;
}
}
fout<<sum;
}