Cod sursa(job #2506312)
Utilizator | Data | 7 decembrie 2019 20:14:07 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 85 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main()
{
int n;fin>>n;
int st=1,dr=n;
int a[n+1];
for(int i=1;i<=n;i++)fin>>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;}
}
fout<<bestSum<<" "<<st<<" "<<dr;
return 0;
}