Cod sursa(job #2732536)
Utilizator | Data | 28 martie 2021 23:59:17 | |
---|---|---|---|
Problema | Deque | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
using namespace std;
ifstream f("deque.in");
ofstream g("deque.out");
int x[5000000], y[5000000];
int main()
{
int n,k,i,a=1,b=0;
long long sum=0;
f>>n;
f>>k;
for(i=0;i<n;i++)
{
f>>x[i];
}
for(i=0;i<n;i++)
{
while( a<=b && x[i]<=x[y[b]])
{
b--;
}
b++;
y[b]=i;
if(y[a]==i-k)
{
a++;
}
if(i>=k)
{
sum=sum+x[y[a]];
}
}
g<<sum;
return 0;
}