Pagini recente » Cod sursa (job #2909122) | Cod sursa (job #2778526) | Cod sursa (job #1402434) | Cod sursa (job #104704) | Cod sursa (job #1634300)
#include <fstream>
using namespace std;
ifstream fin("deque.in");
ofstream fout("deque.out");
int v[5000005], deque[5000005], n, k, st, dr;
long long Sol;
int main()
{
fin>>n>>k;
st=1, dr=0;
for(int i=1;i<=n;i++)
{
if(deque[st]<i-k+1)
st++;
fin>>v[i];
while(v[i]<=v[deque[dr]] && dr>=st)
dr--;
deque[++dr]=i;
if(i>=3)
Sol+=v[deque[st]];
}
fout<<Sol;
return 0;
}