Pagini recente » Cod sursa (job #1597663) | Cod sursa (job #1231279) | Cod sursa (job #967242) | Cod sursa (job #2219545) | Cod sursa (job #3332526)
#include<fstream>
using namespace std;
int x[5000002],v[5000002];
long long int s=0;
main()
{
ifstream f("deque.in");
ofstream g("deque.out");
int i,start=1,n,stop=0,k;
f>>n>>k;
for(i=1; i<k; ++i)
{
f>>x[i];
while(start<=stop && x[i]<=x[v[stop]])
--stop;
v[++stop]=i;
}
for(i=k; i<=n; i++)
{
f>>x[i];
if(v[start]==i-k)
start++;
while(start<=stop && x[i]<=x[v[stop]])
--stop;
v[++stop]=i;
s+=x[v[start]];
}
g<<s;
}