Pagini recente » Cod sursa (job #2847794) | Cod sursa (job #1658875) | Cod sursa (job #1624886) | Cod sursa (job #278341) | Cod sursa (job #2958131)
#include <iostream>
#include <fstream>
using namespace std;
ifstream cin ("ssm.in");
ofstream cout ("ssm.out");
int
main ()
{
int n, i, v[6000001], best[6000001], bestsum, r1 = 1, r2 = 0;
cin >> n;
for (i = 1; i <= n; i++)
cin >> v[i];
best[0] = 0;
bestsum = v[1];
for (i = 1; i <= n; i++)
{
best[i] = v[i];
if (v[i] < best[i - 1] + v[i])
best[i] = best[i - 1] + v[i];
else
r1++;
if (best[i] > bestsum)
{
bestsum = best[i];
r2 = i;
}
}
cout << bestsum << " " << r1 << " " << r2;
return 0;
}