Cod sursa(job #1814185)
Utilizator | Nitica Ionut Bogdan Bovisio | Data | 23 noiembrie 2016 18:44:27 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.65 kb |
#include <cstdio>
using namespace std;
int n,a[7000005];
int beg,end,ind,sum=0,bestSum=0;
void Dinamic()
{
for(int i=1;i<=n;i++)
{
if(sum < 0)
{
sum = a[i];
ind = i;
}
else
sum = a[i] + sum;
if(bestSum < sum)
{
bestSum = sum;
beg = ind;
end = i;
}
}
}
int main()
{
freopen("ssm.in","r",stdin);
//freopen("ssm.out","w",stdout);
scanf("%i",&n);
for(int i=1;i<=n;i++)
scanf("%i",&a[i]);
Dinamic();
printf("%i %i %i",bestSum,beg,end);
return 0;
}