Cod sursa(job #678187)
Utilizator | Data | 11 februarie 2012 10:30:17 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.68 kb |
#include <cstdio>
using namespace std;
int a[100],n,sum[100],best[100];
void citire()
{
scanf("%d",&n);
for(int i=0;i<n;i++)
scanf("%d",&a[i]);
}
void suma()
{
int s=0,inceput,sfarsit,smax=-int(2e9),beg;
for(int i=0;i<n;i++)
{
if(s<0)
{
s=a[i];
beg=i+1;
}
else
s+=a[i];
if(smax<s)
{
smax=s;
inceput=beg;
sfarsit=i+1;
}
}
printf("%d %d %d\n",smax,inceput,sfarsit);
}
int main()
{
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
citire();
suma();
return 0;
}