Cod sursa(job #359932)
Utilizator | Data | 28 octombrie 2009 21:50:37 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include<stdio.h>
int n,Sol=-2147483647,sol,P,U,p,u,v;
void read(),solve();
int main()
{
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
scanf("%d",&n);
for(u=1;u<=n;u++)
{
scanf("%d",&v);
if(sol<0){sol=v;p=u;}
else sol+=v;
if(sol>Sol){Sol=sol;P=p;U=u;}
}
printf("%d %d %d\n",Sol,P,U);
return 0;
}