Cod sursa(job #3354635)
| Utilizator | Data | 19 mai 2026 15:19:30 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <iostream>
using namespace std;
int s[6000001], n;
int main()
{
int i, j, st, dr;
cin >> n;
for(i = 1; i <= n; i++)
cin >> s[i];
int sum = 0, smax = s[1];
i = j = 1;
st = dr = 1;
while(j <= n)
{
sum += s[j];
if(sum > smax)
{
smax = sum;
st = i;dr = j;
}
if(sum < 0)
{
sum = 0;
i = j + 1;
}
j++;
}
cout << smax << " " << st << " " << dr << "\n";
return 0;
}
