Cod sursa(job #1836387)
Utilizator | Lieb Hanna Hanna | Data | 28 decembrie 2016 12:35:58 |
---|---|---|---|
Problema | Deque | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
#include <deque>
using namespace std;
typedef pair<int,int> adat;
int main()
{
ifstream cin("deque.in");
ofstream cout("deque.out");
int n,k,a;
cin>>n>>k;
long long o=0;
deque <adat> x;
for(int i=1;i<=n;i++)
{
cin>>a;
while(!x.empty() && a<=x.back().first )
x.pop_back();
x.push_back(adat(a,i));
while(x.front().second < i-k+1) x.pop_front();
if(i>=k) o+=x.front().first;
}
cout<<o<<"\n";
return 0;
}