Pagini recente » Cod sursa (job #447058) | Cod sursa (job #1436119) | Cod sursa (job #638178) | Cod sursa (job #3261320) | Cod sursa (job #1428885)
#include <cstdio>
#include <climits>
using namespace std;
int best[6000003];
int max, inds, indsa, inde, sum;
int maxim(int a, int b)
{
return a > b ? a: b;
}
int main()
{
int n, i;
freopen("ssm.in", "r", stdin);
freopen("ssm.out", "w", stdout);
scanf("%d", &n);
i = 0;
while(i < n)
{
scanf("%d" , &best[i]);
i++;
}
max = INT_MIN;
sum = 0;
for(i = 0 ; i < n; i++)
{
if(sum < 0)
{
sum = best[i];
indsa = i;
}
else
{
sum += best[i];
}
if(sum > max)
{
max = sum;
inde = i;
inds = indsa;
}
}
printf("%d %d %d\n", max, inds + 1, inde + 1);
return 0;
}