Cod sursa(job #3246849)
Utilizator | Data | 4 octombrie 2024 16:33:17 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 85 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.83 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n, inc, sf, Max;
int main()
{
fin >> n;
int v[n + 1], dp[n + 1];
for(int i = 1; i <= n; i++)
{
fin >> v[i];
}
dp[1] = v[1];
Max = dp[1];
inc = 1;
sf = 1;
for(int i = 2; i <= n; i++)
{
if(dp[i - 1] >= 0)
{
dp[i] = dp[i - 1] + v[i];
if(dp[i] > Max)
{
Max = dp[i];
sf = i;
}
}
else
{
dp[i] = v[i];
inc = i;
if(dp[i] > Max)
{
Max = dp[i];
sf = i;
}
}
}
fout << Max << " " << inc << " " << sf;
return 0;
}