Pagini recente » Cod sursa (job #2483149) | Cod sursa (job #796988) | Cod sursa (job #2440258) | Cod sursa (job #293299) | Cod sursa (job #1071598)
#include <fstream>
using namespace std;
int main()
{
int a[60000000], b[60000000], i, n, max, j, k;
ifstream f("ssm.in");
ofstream g("ssm.out");
f >> n;
for (i = 1; i <= n; i++)
f >> a[i];
max=a[1];
k = j = 0;
for (i = 1; i <= n; i++)
{
b[i] = a[i];
if (a[i] < b[i - 1] + a[i])b[i] = b[i - 1] + a[i];
else k = i;
if (b[i]>max)max = b[i], j = i;
}
g << max << " " << k << " " << j;
return 0;
}