Cod sursa(job #2048490)
Utilizator | Data | 26 octombrie 2017 06:28:21 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream cin("ssm.in");
ofstream cout("ssm.out");
int x,n,bst,ma,st=1,dr,sts,drs;
int main()
{
cin>>n>>bst;
ma=bst;
for(int i=2;i<=n;i++)
{
cin>>x;
if(x>bst+x)
{
bst=x;
st=i;
}
else
bst+=x;
dr=i;
if(bst>ma)
{
sts=st;
drs=dr;
ma=bst;
}
}
cout<<ma<<" "<<sts<<" "<<drs;
return 0;
}