Pagini recente » Cod sursa (job #1185226) | Cod sursa (job #3123864) | Cod sursa (job #3201670) | Cod sursa (job #3250417) | Cod sursa (job #2472220)
#include <iostream>
#include <vector>
#include <fstream>
using namespace std;
vector<int> valori, sume;
int indmin, n, k, indmax, indminmax;
ifstream f("secv2.in");
ofstream g("secv2.out");
int main() {
f>>n>>k;
{
int x;
f>>x;
valori.push_back(x);
sume.push_back(x);
indmin = 0;
}
for (int i = 1, x; i < k; ++i) {
f>>x;
valori.push_back(x);
sume.push_back(x + sume[sume.size() - 1]);
if(sume[i] < sume[indmin])
indmin = i;
}
for (int i = k, x; i < n; ++i) {
f>>x;
valori.push_back(x);
sume.push_back(x + sume[sume.size() - 1]);
if(sume[i] < sume[indmin])
indmin = i;
if(sume[i] - sume[indmin] > sume[indmax] - sume[indminmax]){
indminmax = indmin;
indmax = i;
}
}
g<<indminmax+2<<' '<<indmax+1<<' '<<sume[indmax] - sume[indminmax];
return 0;
}