Cod sursa(job #2631380)
Utilizator | Sireanu Vlad sireanu_vlad | Data | 30 iunie 2020 11:13:21 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.65 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int main()
{
int n;
in >> n;
int s, s1, v; in >> s1;
int maxSum = -2147483647, start, j = 0, stop, minS = s1;
for(int i = 1; i < n; i++)
{
in >> v;
s = s1 + v;
if(s - minS > maxSum)
{
maxSum = s - minS;
stop = i;
start = j + 1;
}
if(s < minS)
{
minS = s;
j = i;
}
s1 = s;
}
out << maxSum << " " << start + 1 << " " << stop + 1 << endl;
return 0;
}