Cod sursa(job #2343722)
| Utilizator | Data | 14 februarie 2019 11:46:26 | |
|---|---|---|---|
| Problema | Deque | Scor | 25 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
#include <deque>
using namespace std;
ifstream in("deque.in");
ofstream out("deque.out");
int v[5000000],dq[5000000];
int main()
{
int n,k,sum=0;
in>>n>>k;
for(int i=0;i<n;i++)
{
in>>v[i];
}
int st=0,dr=-1;
for(int i=0;i<n;i++)
{
if(st<=dr&&dq[st]==i-k)
st++;
while(st<=dr&&v[i]<=v[dq[dr]])
dr--;
dq[++dr]=i;
if(i>=k-1)
{
sum+=v[dq[st]];
}
}
out<<sum;
return 0;
}
