Cod sursa(job #3333883)
| Utilizator | Data | 15 ianuarie 2026 15:26:53 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <fstream>
using namespace std;
ifstream cin("ssm.in");
ofstream cout("ssm.out");
int arr[6000001];
int main()
{
int n;
cin >> n;
for (int i = 1; i <= n; i++) cin >> arr[i];
int st, dr, maxi = -2000000000, s = 0, start;
for (int i = 1; i <= n; i++)
{
if (s < 0)
{
s = 0;
start = i;
}
s += arr[i];
if (s > maxi)
{
maxi = s;
st = start;
dr = i;
}
}
cout << maxi << ' ' << st << " " << dr;
}
