Cod sursa(job #2613018)
Utilizator | Nae Teodora Ioana teodora019 | Data | 9 mai 2020 14:19:45 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
using namespace std;
ifstream cin("ssm.in");
ofstream cout("ssm.out");
int v[6000001], s[6000001];
int main()
{
int n, i, j, ci, start, end, maxx=-2147483648;
cin>>n;
for(i=1; i<=n; i++)
cin>>v[i];
for(i=1; i<=n; i++)
{
if(s[i-1]>0)
s[i]=s[i-1]+v[i];
else
{s[i]=v[i];
ci=i;
}
if(s[i]>maxx){
maxx=s[i];
start=ci;
end=i;
}
}
cout<<maxx<<' '<<start<<' '<<end;
return 0;
}