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