Pagini recente » Cod sursa (job #2570565) | Cod sursa (job #1822515) | Cod sursa (job #636881) | Cod sursa (job #2921974) | Cod sursa (job #1099467)
#include <fstream>
#define nmax 6000001
#define inf -10000000
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int a[nmax],n, best;
int main()
{
f >> n;
for (int i=1;i<=n;i++)
f >> a[i];
int bestsum = inf,test = inf, start = 0, last = 0;
best = a[1] ;
for (int i=1;i<=n;i++)
{
if (best < 0) { best = a[i]; test = i; }
else best += a[i];
if (best > bestsum) {bestsum = best; last = i; start = test; }
}
g << bestsum << " " << start << " " << last;
return 0;
}