Cod sursa(job #540947)
| Utilizator | Data | 24 februarie 2011 17:51:45 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 95 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include <cstdio>
using namespace std;
int s,a,i,p,u,ul,pr,smax,n;
int main()
{
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
scanf("%d",&n);
smax=-20000000;
p=1;
u=1;
for(i=1;i<=n;i++)
{
scanf("%d",&a);
if(s+a>a)
{
s=s+a;
u=i;
}
else
{
p=i;
u=i;
s=a;
}
if(s>smax)
{
smax=s;
pr=p;
ul=u;
}
}
printf("%d %d %d",smax,pr,ul);
return 0;
}
