Pagini recente » Rating Butoi Emilian (Emilian_123) | Cod sursa (job #2858964) | Cod sursa (job #658832) | Cod sursa (job #205612) | Cod sursa (job #1464090)
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <limits.h>
using namespace std;
int main()
{
freopen("ssm.in", "r", stdin);
freopen("ssm.out", "w", stdout);
int maxim = INT_MIN;
int n;
int sum = 0;
int a = 0;
int b = 0;
int max1 = 0, max2 = 0;
scanf("%i\n", &n);
for(int k = 0; k < n; k++)
{
int x;
scanf("%i ", &x);
sum +=x;
if(sum < 0)
{
sum = x;
a = k + 1;
b = k + 1;
}
if(maxim < sum)
{
maxim = max(maxim, sum);
max1 = a;
max2 = b;
}
b++;
}
printf("%i %i %i", maxim, max1 + 1, max2 + 1);
return 0;
}