Cod sursa(job #2926705)
| Utilizator | Data | 18 octombrie 2022 14:40:31 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("ssm.in");
ofstream g ("ssm.out");
int n , i , s = -2e9 , smax = -2e9 , stop , start , x , st , dr;
int main()
{
f >> n;
for(i = 1 ; i <= n ; i++)
{
f >> x;
if(s < 0)
s = 0 , start = i;
s = s + x;
if(s > smax)
smax = s , st = start , dr = i;
}
g << smax << " " << st << " " << dr;
return 0;
}
