Cod sursa(job #1279103)
Utilizator | Data | 29 noiembrie 2014 19:40:54 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int v[6000010],n,i,start,ini,fini,maxi=-1999999999;
int main()
{
fin>>n;
start=1;
for(i=1;i<=n;++i)
{
fin>>v[i];
if(v[i-1]<=0)
{
start=i;
}
else
{
v[i]+=v[i-1];
if(v[i]>maxi)
{
maxi=v[i];
ini=start;
fini=i;
}
}
}
fout<<maxi<<" "<<ini<<" "<<fini;
return 0;
}