Cod sursa(job #2177591)
Utilizator | Nitica Ionut Bogdan Bovisio | Data | 18 martie 2018 18:08:45 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include <cstdio>
#define max(a,b) ((a) > (b) ? (a) : (b))
using namespace std;
int n,a[1000001],ma=-1,aux;
int main()
{
int xs,xf,sum;
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
scanf("%i %i",&n,&aux);
for(int i=1;i<n;i++)
{
scanf("%i",&a[i]);
aux = max(aux+a[i],a[i]);
if(aux > ma)
{
xf = i;
ma = aux;
}
}
sum = ma;
xs=xf;
while(sum != 0)
{
sum -= a[xs];
xs--;
}
printf("%i %i %i",ma,xs+2,xf+1);
return 0;
}