Pagini recente » Cod sursa (job #1089545) | Cod sursa (job #2934732) | Cod sursa (job #1613316) | Cod sursa (job #87572) | Cod sursa (job #799519)
Cod sursa(job #799519)
# include <fstream>
# define nmax 5000005
using namespace std;
ifstream fin("deque.in");
ofstream fout("deque.out");
int n, k;
int deque[nmax];
int a[nmax];
int p, q;
long long sum;
int main() {
int i;
fin >> n >> k;
for(i = 1; i <= n; ++ i) fin >> a[i];
p = 1; q = 0;
for(i = 1; i <= n; ++ i) {
while(p <= q && a[i] <= a[deque[q]]) --q;
deque[++q] = i;
if(deque[p] == i-k) ++p;
if(i >= k) sum += a[deque[p]];
}
fout << sum << "\n";
return 0;
}