Cod sursa(job #2573929)
Utilizator | Data | 5 martie 2020 19:29:10 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 45 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("ssm.in");
ofstream fout ("ssm.out");
int n, i, s, best, a, b, w;
int v[500000];
int main()
{
fin >> n;
for(i=1; i<=n; i++)
{
fin >> v[i];
}
for(i=1; i<=n; i++)
{
if(s<=0)
{
s=v[i];
w=i;
}
else
s=s+v[i];
if(best<s)
{
best=s;
a=w;
b=i;
}
}
fout << best << " " << a << " " << b;
return 0;
}