Cod sursa(job #2928090)
Utilizator | Furtuna-Cola Andrei Alexandru KitsuRaine | Data | 22 octombrie 2022 10:32:54 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n,i,a[6000005],bestSum;
int main()
{
f>>n;
long bestSum = -2000000000, sum = 0, st, dr, p;
for(int i=1; i<=n; i++)
{
f>>a[i];
if (sum < 0)
{
sum = a[i];
p = i;
}
else
sum += a[i];
if (bestSum < sum)
{
bestSum = sum;
st = p;
dr = i;
}
}
g<<sum+a[dr]<<" "<<st<<" "<<dr;
return 0;
}