Pagini recente » Cod sursa (job #1760543) | Cod sursa (job #3242945) | Cod sursa (job #1530614) | Cod sursa (job #233569) | Cod sursa (job #2915431)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
int n;
ifstream in("ssm.in");
ofstream out("ssm.out");
in >> n;
int partial[n+1];
in >> partial [1];
partial[0] = 0;
int x = 0,y = 0,max = partial[1];
for (int i = 2;i < n+1; i++)
{
int aux;
in >> aux;
partial[i] = partial[i-1] + aux;
}
int min = partial[0];
int x1 = 0;
for (int j = 1; j <= n; j++)
{
if (partial[j-1] < min)
{
min = partial[j - 1];
x1 = j-1;
}
if (partial[j] - min > max)
{
max = partial[j] - min;
y = j;
x = x1 + 1;
}
}
out << max <<" " << x << " " << y;
return 0;
}