Cod sursa(job #2909330)
Utilizator | Asd asd llama27 | Data | 12 iunie 2022 21:12:53 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int main()
{
int bestsum = -(1<<31), sum = 0;
int best_i, best_j, start;
int n, x;
in>>n;
for(int k = 1; k <= n; k++){
in>>x;
if(sum < 0)
sum=x, start = k;
else
sum+=x;
if(sum > bestsum){
bestsum = sum;
best_i = start;
best_j = k;
}
}
out<<bestsum<<' '<<best_i<<' '<<best_j;
}