Cod sursa(job #2926724)
| Utilizator | Data | 18 octombrie 2022 15:18:21 | |
|---|---|---|---|
| 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 f("ssm.in");
ofstream g("ssm.out");
long long n , s[6000009] , best ;
int main()
{
f >> n;
for (int i = 1 ; i <= n ; i++)
f >> s[i];
best = -99999999;
int sum = 0 , st , sf , idx;
for ( int i = 1 ; i <= n ; i++)
{
if( sum < 0)
sum = s[i] , idx = i;
else
sum += s[i];
if(best < sum)
best = sum , st = idx , sf = i;
}
g << best << " " << st << " " << sf;
}
