Cod sursa(job #2487562)
| Utilizator | Data | 4 noiembrie 2019 22:28:28 | |
|---|---|---|---|
| Problema | Deque | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <fstream>
using namespace std;
ifstream cin("deque.in");
ofstream cout("deque.out");
int st[5000001];
int v[5000001];
int main()
{
int n,k,i,s=1,d=0;
long long sum=0;
cin>>n>>k;
for(i=1;i<=k;i++)
{
cin>>v[i];
while(d>=s && v[st[d]]>v[i])
d--;
d++;
st[d]=i;
}
sum+=v[st[s]];
for(i=k+1;i<=n;i++)
{
cin>>v[i];
if(i-k==st[s])
s++;
while(d>=s && v[st[d]]>v[i])
d--;
d++;
st[d]=i;
sum+=v[st[s]];
}
cout<<sum;
return 0;
}
