Cod sursa(job #1724993)
| Utilizator | Data | 4 iulie 2016 18:10:32 | |
|---|---|---|---|
| Problema | Deque | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.69 kb |
#include<iostream>
#include<fstream>
#define ll long long
using namespace std;
ifstream f("deque.in");
ofstream g("deque.out");
int main()
{
ll i,sum=0,n,k,min,j,pmin;
f>>n>>k;
ll a[n+1];
for(i=1;i<=n;i++)
f>>a[i];
for(i=1;i<=n-k+1;i++)
{
if(i>1&&pmin>=i){
if(a[pmin] < a[i+k-1])
sum=sum+a[pmin];
else
sum=sum+a[i+k-1];
}else
{
min =a[i];
for(j=0;j<k;j++)
if(min>a[j+i])
{
min=a[j+i];
pmin=i+j;
}
sum=sum+min;
}
//cout<<min<<" ";
}
g<<sum;
return 0;
}
