Cod sursa(job #504225)
Utilizator | Data | 27 noiembrie 2010 10:50:07 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
using namespace std;
int s=0;
int main()
{ int x=0;,y=0;
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
int *p;
int lg;
scanf("%d\n",&lg);
p=new int(lg);
for(int i=0;i<lg;i++)
scanf("%d ",&p[i]);
int Mx=0;
for(int i=0;i<lg;i++){
s+=p[i];
if(s<0)
s=0,x=i;
if(s>Mx)
Mx=s,y=i;
}
printf("%d %d %d",Mx,x,y);
return 0;
}