Pagini recente » Cod sursa (job #2210713) | Cod sursa (job #2292520) | Cod sursa (job #2767449) | Cod sursa (job #3132141) | Cod sursa (job #2081113)
// Se da un sir cu N elemente
// Gasiti subsecventa de suma maxima
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main()
{
int indiceInceput = 1, indiceFinal;
int N,x, suma_maxima = 0, suma = 0;
fin >> N;
for(int i = 1; i<= N; i++)
{
fin >> x;
suma+= x;
if(suma>= 0 && suma > suma_maxima)
{
suma_maxima = suma;
indiceFinal = i;
}
else if(suma<0){
suma = 0;
indiceInceput = i;
}
}
fout << suma_maxima << " " << indiceInceput << " " << indiceFinal;;
return 0;
}