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