Cod sursa(job #2431437)
| Utilizator | Data | 19 iunie 2019 14:40:11 | |
|---|---|---|---|
| Problema | Deque | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include<fstream>
#include<deque>
using namespace std;
ifstream cin("deque.in");
ofstream cout("deque.out");
long long int v[5000005],n,k,i,s=0;
deque <int> ciudata;
int main()
{
cin>>n>>k;
for(i=1;i<=n;i++)cin>>v[i];
for(i=1;i<=n;i++)
{
while(!ciudata.empty()&&v[i]<=v[ciudata.back()])ciudata.pop_back();
ciudata.push_back(i);
if(ciudata.front()==i-k)ciudata.pop_front();
if(k<=i) s=s+v[ciudata.front()];
}
cout<<s;
}
