Cod sursa(job #2909324)
Utilizator | Data | 12 iunie 2022 19:37:51 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int bestSum = -int(2e9),n,x,inceput,sfarsit,index;
int main()
{
int sum = 0;
in>>n;
for(int i = 1; i <= n; i++)
{
in>>x;
if(sum < 0)
{
sum = x;
index = i;
}
else
{
sum += x;
}
if(sum > bestSum)
{
bestSum = sum;
inceput = index;
sfarsit = i;
}
}
out<<bestSum<<' '<<inceput<<' '<<sfarsit;
}