Cod sursa(job #2867807)
| Utilizator | Data | 10 martie 2022 16:12:08 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
int max_sum = -(1<<30), sum_now = 0, poz1 = -1, poz2 = -1;
for (int i = 1;i<=n;++i)
{
int a;
cin >> a;
if (sum_now + a > 0)
{
sum_now += a;
if (sum_now > max_sum)
max_sum = sum_now, poz2 = i;
}
else
sum_now = a, poz1 = i, poz2 = i;
}
cout << max_sum << ' ' << poz1 << ' ' << poz2 << '\n';
return 0;
}