Pagini recente » Cod sursa (job #2842335) | Cod sursa (job #1295834) | Cod sursa (job #1744675) | Cod sursa (job #1329431) | Cod sursa (job #2675525)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
void citire(int &N, int &K, int sir[]){
fin >> N >> K;
for(int i = 1; i <= N; i++){
fin >> sir[i];
}
}
void suma_max(int sir[], int N, int K){
int suma_maxima = 0, suma, poz_min = 0, poz_max = 0;
for(int i = 1; i <= N - K + 1; i++){
suma = 0;
for(int j = i; j <= N; j++){
suma += sir[j];
if((j - i + 1) < K){
continue;
}
if(suma_maxima == 0){
suma_maxima = suma;
poz_min = i;
poz_max = j;
}
else if(suma_maxima < suma){
suma_maxima = suma;
poz_min = i;
poz_max = j;
}
}
}
fout << poz_min << " " << poz_max << " " << suma_maxima << endl;
}
int main(){
int N, K;
int sir[50000];
citire(N, K, sir);
suma_max(sir, N, K);
return 0;
}