Cod sursa(job #504230)
Utilizator | Data | 27 noiembrie 2010 10:53:42 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 75 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <stdio.h>
using namespace std;
int n;
int main()
{
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
scanf("%d",&n);
int a;
int max=-10000;
int s=0;
int j,k;
for(int i=0;i<n;i++)
{
scanf("%d",&a);
s+=a;
if(s>max)
max=s,k=i;
if(s<0)
s=0,j=i+1;
}
printf("%d %d %d",max,j+1,k+1);
return 0;
}