Cod sursa(job #3247373)
| Utilizator | Data | 7 octombrie 2024 14:12:16 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 90 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <fstream>
using namespace std;
ifstream fin ("ssm.in");
ofstream fout ("ssm.out");
int v[7000001], dp[7000001];
int main()
{
int n, sum = 0, st, dr, mare = -1, st_max;
fin >> n;
for(int i = 1; i <= n; i++)
fin >> v[i];
dp[1] = v[1];
st = 1;
for(int i = 1; i <= n; i++)
{
if(dp[i - 1] > 0)
{
dp[i] = dp[i - 1] + v[i];
}
else
{
dp[i] = v[i];
st = i;
}
if (mare < dp[i]) {
st_max = st;
dr = i;
mare = dp[i];
}
}
fout << mare << " " << st_max << " " << dr;
return 0;
}
