Cod sursa(job #3309775)
| Utilizator | Data | 8 septembrie 2025 20:41:01 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
using namespace std;
int main(){
int n, a[100001];
cin >> n;
for(int i = 1;i <= n;i++)
cin >> a[i];
int suma = 0, smax = 0, l = 0, st, dr;
for(int i = 1;i <= n;i++){
if(suma < 0)
suma = 0, l = 0;
suma += a[i], l++;
if(suma > smax)
smax = suma, st = i - l + 1, dr = i;
}
cout << st << ' ' << dr;
}
