Cod sursa(job #2857544)
| Utilizator | Data | 25 februarie 2022 19:42:06 | |
|---|---|---|---|
| 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 fin("ssm.in");
ofstream fout("ssm.out");
int n, x, s, smax, k, st, dr;
int main()
{
fin >> n;
fin >> x;
s = x; smax = x;
for(int i=2; i<=n; i++){
fin >> x;
if(s < 0){
s = x;
k = i;
}
else
s += x;
if(smax < s){
smax = s;
st = k;
dr = i;
}
}
fout << smax << ' ' << st << ' ' << dr;
return 0;
}
