Cod sursa(job #821164)
Utilizator | Data | 21 noiembrie 2012 20:21:15 | |
---|---|---|---|
Problema | Deque | Scor | 5 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include<iostream>
#include<fstream>
using namespace std;
int main(){
long long n, k, a[100005], b[100005], i, j, S=0;
ifstream f("deque.in");
ofstream g("deque.out");
f>>n>>k;
for(i=1;i<=n;i++)
f>>a[i];
for(i=1;i<=n-k+1;i++){
b[i]=a[i];
for(j=i;j<i+k;j++){
if(a[j]<a[i]){
b[i]=a[j];
}
}
}
for(i=1;i<=n;i++)
S=S+b[i];
g<<S;
}