Pagini recente » Cod sursa (job #2928929) | Cod sursa (job #44601) | Cod sursa (job #3149298) | Cod sursa (job #1505213) | Cod sursa (job #2675837)
#include <iostream>
#include <fstream>
#include <climits>
using namespace std;
ifstream fin ("ssm.in");
ofstream fout ("ssm.out");
const int valMax = 6e6;
int v[valMax+1], s[valMax+1];
int main()
{
int n, i, j = 0, st, dr, summax = INT_MIN;
fin >> n;
for (i = 1; i <= n; i++)
{
fin >> v[i];
s[i] = max(s[i-1]+v[i], v[i]);
if (s[i] != s[i-1]+v[i])
{
j = i;
}
if (s[i] > summax)
{
summax = s[i];
st = j;
dr = i;
}
}
cout << summax << ' ' << st << ' ' << dr;
return 0;
}