Pagini recente » Istoria paginii runda/oji20192 | preONI 2008 - Clasament Runda 3, Clasa a 10-a | Istoria paginii info-oltenia-2019/individual/5-6 | Clasament tl | Cod sursa (job #1132908)
#include <iostream>
#include<fstream>
using namespace std;
int max(int a, int b)
{
return a > b ? a : b;
}
int main()
{
int n, v, startindex=1, endindex=1, partialsum = 0, partialsumLast = 0, bestsum=INT_MIN;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
fin >> n;
for (int i = 1; i <= n; i++)
{
fin >> v;
partialsumLast = partialsum;
partialsum = max(partialsumLast + v, v);
if (partialsum == v)
startindex = i;
if (bestsum < partialsum )
{
bestsum = partialsum;
endindex = i;
}
}
fout << bestsum << " " << startindex << " " << endindex;
return 0;
}