Cod sursa(job #873794)
Utilizator | Bratie Fanut bratiefanut | Data | 7 februarie 2013 17:15:11 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
ifstream cin("ssm.in");
ofstream cout("ssm.out");
int n,i,j,suma,prim,p=0,ult,op[60000],v[6000000];
int main()
{
cin>>n;
for(i=1;i<=n;i++)
cin>>v[i];
suma=v[1];
for(i=1;i<=n;i++)
{
op[i]=v[i];
if(op[i]<op[i-1]+v[i])
{op[i]=op[i-1]+v[i];p=i;}
if(suma<op[i])
{suma=op[i];prim=p; ult=i;}
}
cout<<suma<<' '<<prim<<' '<<ult;
return 0;
}