Cod sursa(job #3333872)
| Utilizator | Data | 15 ianuarie 2026 15:20:07 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
ifstream cin("ssm.in");
ofstream cout("ssm.out");
int n;
cin >> n;
int a[n],i;
for (i = 0; i < n; i++)
cin >> a[i];
int Smax = INT_MIN, s = -1, st, dr, start;
for (i = 0; i < n; i++) {
if (s < 0)
s = 0, start = i;
s+=a[i];
if (s > Smax)
Smax = s, st = start, dr = i;
}
cout << Smax << ' ' << st+1 << ' ' << dr+1;
return 0;
}
