Cod sursa(job #1367629)
Utilizator | Data | 1 martie 2015 23:45:36 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n,b[6000000],in,fi,s;
int main()
{
int i,j,l,x;
f>>n;
f>>x;
s=x;
b[1]=x;
in=1;
fi=1;
l=1;
for(i=2;i<=n;i++)
{
f>>x;
b[i]=max(b[i-1]+x,x);
if(b[i]>s)
{
s=b[i];
fi=i;
l++;
in=l;
}
else l=0;
}g<<s<<" "<<fi-in <<" "<<fi;
}