Cod sursa(job #1239596)
Utilizator | Data | 9 octombrie 2014 12:51:20 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <fstream>
using namespace std;
long n,a[60000001],i,x,y,p,sc,smax;
int main()
{ifstream f("ssm.in");
ofstream g("ssm.out");
f>>n;
for (i=1;i<=n;i++) f>>a[i];
sc=smax=a[1];
p=x=y=1;
for(i=2;i<=n;i++)
{
if(sc>0) sc=sc+a[i];
else{sc=a[i];p=i;}
if(sc>smax){smax=sc;x=p;y=i;}
}
g<<smax<<" "<<x<<" "<<y;
return 0;;
}