Pagini recente » Borderou de evaluare (job #2011968) | Borderou de evaluare (job #530151) | Borderou de evaluare (job #1159530) | Borderou de evaluare (job #167844) | Cod sursa (job #300517)
Cod sursa(job #300517)
#include <fstream>
using namespace std;
int v[5000010], st[5000010], p, u, n, k;
long long s;
int main()
{
ifstream f ("deque.in");
ofstream g ("deque.out");
int i;
f>>n>>k;
for(i=1;i<=n;i++) f>>v[i];
p=1, u=0;
for(i=1;i<=n;i++)
{
while((p<=u)&&(v[i]<=v[st[u]])) u--;
st[++u]=i;
if(st[p]==i-k) p++;
if(i>=k) s+=v[st[p]];
}
g<<s;
return 0;
}