Cod sursa(job #1240664)
Utilizator | Data | 11 octombrie 2014 21:26:04 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int v[7000001],n;
int main()
{
in>>n;
for(int i=1;i<=n;i++)
scanf("%d",&v[i]);
int smax=v[1],s=0,st,dr,x;
for(int i=1;i<=n;i++)
{
if (s<0)
s=v[i],x= i;
else
s+=v[i];
if (smax<s)
smax=s,st=x,dr=i;
}
out<<smax<<" "<<st<<" "<<dr;
return 0;
}