Pagini recente » Cod sursa (job #1904949) | Cod sursa (job #2671470) | Istoria paginii runda/eusebiu_oji_2018_cls9/clasament | Cod sursa (job #1545896) | Cod sursa (job #2225440)
#include<fstream>
using namespace std;
ifstream cin("secv2.in");
ofstream cout("secv2.out");
int v[50001];
int main()
{
int n,k,poz,i,maxim;
cin >> n >> k;
for(i = 1;i <= n;i++){
cin >> v[i];
v[i] += v[i-1];
}
for(i = k,maxim = k;i <= n;i++){
if(v[i] > v[maxim])
maxim = i;
}
for(i = maxim-k,poz = maxim-k;i >= 0;i--){
if(v[i] < v[poz]){
poz = i;
}
}
cout << poz+1 << " " << maxim << " " << v[maxim] - v[poz];
return 0;
}