Pagini recente » Cod sursa (job #353227) | Cod sursa (job #604847) | Cod sursa (job #80179) | Cod sursa (job #3256051) | Cod sursa (job #2631376)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int main()
{
int n;
in >> n;
int v[n];
for(int i = 0; i < n; i++)
in >> v[i];
int s[n]; s[0] = v[0];
int maxSum = -2147483647, start, j = 0, stop, minS = s[0];
for(int i = 1; i < n; i++)
{
s[i] = s[i-1] + v[i];
if(s[i] - minS > maxSum)
{
maxSum = s[i] - minS;
stop = i;
start = j + 1;
}
if(s[i] < minS)
{
minS = s[i];
j = i;
}
}
out << maxSum << " " << start + 1 << " " << stop + 1 << endl;
return 0;
}