Pagini recente » Cod sursa (job #2127036) | Cod sursa (job #1569371) | Monitorul de evaluare | Cod sursa (job #1513677) | Cod sursa (job #1522900)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int main()
{
int n, v[500000], k, j;
long s, smax;
f >> n;
for(int i = 1; i <= n; i++)
f >> v[i];
s = v[1];
if(s < 0)
s = 0;
smax = 0;
for(int i = 2; i <= n; i++)
{
s += v[i];
j++;
if(s > smax)
smax = s;
if(s < 0)
s = 0, k = i + 1, j = i;
}
j--;
g << smax << " " << k << " " << j;
return 0;
}