Pagini recente » Cod sursa (job #2149232) | Istoria paginii utilizator/razvangggg | Diferente pentru preoni-2006/runda-1/solutii intre reviziile 17 si 16 | Istoria paginii utilizator/ancaiv | Cod sursa (job #2674414)
#include <fstream>
#include <deque>
using namespace std;
ifstream cin("deque.in");
ofstream cout("deque.out");
deque < int > deq;
int v[5000005];
int main()
{
int i, j, n, k, a, sum=0;
cin >> n >> k;
for( i=1; i<=n; i++ )
{
cin >> v[i];
while( !deq.empty() and v[deq.back()] >= v[i] )
deq.pop_back();
deq.push_back( i );
if( deq.front() <= i-k)
deq.pop_front();
if( i >= k )
sum+= v[deq.front()];
}
cout << sum;
return 0;
}