Cod sursa(job #850071)
Utilizator | Oncescu Andreea geniuandu | Data | 7 ianuarie 2013 23:16:47 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 1.05 kb |
#include<cstdio>
using namespace std;
int n,i,mini,maxi,s,ls,ld,poz,maxi1,ok,v[6000001];
int main()
{
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
scanf("%d",&n);
maxi1=-(1<<31);
for(i=1;i<=n;i++)
{
scanf("%d",&v[i]);
if(v[i]>maxi1)
{
maxi1=v[i];
poz=i;
}
}
if(maxi1<0)
{
printf("%d %d %d",maxi1,poz,poz);
}
else
{
s=v[1];
maxi=-(1<<31);
ls=1;
ok=0;
for(i=2;i<=n;i++)
{
if(s>maxi)
{
maxi=s;
ld=i-1;
ok=1;
}
if(s<0)
{
if(ok==0)
ld=i-1;
s=0;
ls=i;
ok=0;
}
s=s+v[i];
}
if(s>maxi)
{
maxi=s;
ld=i-1;
ok=1;
}
printf("%d %d %d",maxi,ls,ld);
}
return 0;
}