Cod sursa(job #504231)
Utilizator | Data | 27 noiembrie 2010 10:55:43 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 75 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <cstdio>
using namespace std;
int main()
{
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
int s=0,n;
scanf("%d", &n);
int x;
int max=0,pi=0, pf=0;
for(int i=1;i<=n;i++)
{
scanf("%d", &x);
s+=x;
if(s>max){
max=s;
pf=i;
}
if(s<0){
s=0;
pi=i+1;
}
}
printf("%d %d %d", max, pi, pf);
return 0;
}