Cod sursa(job #3042180)
Utilizator | Data | 4 aprilie 2023 15:42:30 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 85 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("ssm.in");
ofstream fout ("ssm.out");
int n,v[6000001];
int main()
{
fin >> n;
for (int i=1;i<=n;i++)
{
fin >> v[i];
}
int max1=-1,s=0,pi,pf;;
for (int i=1;i<=n;i++)
{
s+=v[i];
if (s<0)
s=0,pi=i+1;
if (s>max1)
max1=s,pf=i;
}
fout << max1 << " " << pi << " " << pf;
return 0;
}