Cod sursa(job #2506308)
Utilizator | Data | 7 decembrie 2019 20:07:00 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
using namespace std;
int main()
{
int n,st=1,dr=n;cin>>n;
int a[n+1];
for(int i=1;i<=n;i++)cin>>a[i];
int sum = 0;
int bestSum = -200005;
for (int i = 1; i <= n; i++)
{
sum += a[i];
if (sum < 0)
{sum = 0;st=i+1;}
else if (sum > bestSum)
{bestSum = sum;dr=i;}
}
cout<<bestSum<<" "<<st<<" "<<dr;
return 0;
}