Cod sursa(job #1324475)
Utilizator | Data | 22 ianuarie 2015 13:20:35 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.61 kb |
#include<fstream>
#include<iostream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int a[1000];
int n,i,s,smax,stm,drm,st,dr;
int main ()
{
fin>>n;
for(i=1;i<=n;i++)
{
fin>>a[i];
}
s=a[i];smax=s;stm=1;drm=1;st=1;dr=1;
for(i=2;i<=n;i++)
{
if(a[i]+s>a[i])
{
s=s+a[i];
dr=i;
}
else
{
s=a[i];
st=i;dr=i;
}
if(s>smax)
{
smax=s;stm=st;drm=dr;
}
}
fout<<smax<<" "<<stm<<" "<<drm;
return 0;
}