Cod sursa(job #897166)
Utilizator | Data | 27 februarie 2013 19:12:51 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
using namespace std;
#include<fstream>
int v[1000005];
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main()
{
int n,i,maxi=-1<<30,st,fn,S=0,stfinal;
fin>>n;
for(i=1;i<=n;i++)
fin>>v[i];
for(i=1;i<=n;i++)
{
if(S+v[i]>=v[i])
S=S+v[i];
else
{
S=v[i];
st=i;
}
if(S>=maxi)
{
maxi=S;
fn=i;
stfinal=st;
}
}
fout<<maxi<<" "<<stfinal<<" "<<fn;
return 0;
}