Cod sursa(job #2675761)
| Utilizator | Data | 22 noiembrie 2020 14:54:08 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 90 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.59 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
int main(){
int n,k,i,j,max_element=0,min_element=250000,start,finish;
fin>>n>>k;
int a[n+1];
for (i=1;i<=n;i++){
fin>>a[i];
a[i]+=a[i-1];
if (i==k || (i>k && max_element<a[i])){
max_element=a[i];
finish=i;
}
}
for (i=0;i<=finish-k;i++){
if (a[i]<min_element){
min_element=a[i];
start=i+1;
}
}
fout<<start<<' '<<finish<<' '<<max_element-min_element;
}
