Cod sursa(job #3305058)
| Utilizator | Data | 29 iulie 2025 17:09:36 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <fstream>
#include <climits>
using namespace std;
ifstream f ("ssm.in");
ofstream g ("ssm.out");
int main()
{
int N;
f >> N;
int sum = 0, maxSum = INT_MIN, st = 1, maxst, dr;
for (int i = 1; i <= N; i++)
{
int nr;
f >> nr;
sum += nr;
if (sum > maxSum)
{
maxst = st;
dr = i;
maxSum = sum;
}
if (sum < 0)
{
sum = 0;
st = i + 1;
}
}
g << maxSum << " " << maxst << " " << dr;
return 0;
}
