Pagini recente » Diferente pentru problema/inception intre reviziile 23 si 22 | Cod sursa (job #993617) | Cod sursa (job #1695664) | Cod sursa (job #763240) | Cod sursa (job #1093390)
#include<fstream>
using namespace std;
ifstream f("deque.in");
ofstream g("deque.out");
int n,k,i,inc,sf;
int a[5000005],deque[5000005];
long long suma;
int main()
{
f>>n>>k;
for(i=1;i<=n;i++)
f>>a[i];
inc=1;
sf=0;
suma=0;
for(i=1;i<=n;i++)
{
while((inc<=sf)&&(a[i]<=a[deque[sf]]))
sf--;
sf++;
deque[sf]=i;
if(deque[inc]==i-k)
inc++;
if(i>=k)
suma=suma+a[deque[inc]];
}
g<<suma;
f.close();
g.close();
return 0;
}