Cod sursa(job #2824261)
| Utilizator | Data | 31 decembrie 2021 20:02:40 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 95 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
const int maxN = 6'000'000;
int n, a, dp = -0x3f3f3f3f, ans, poz, st, dr;
int main()
{
fin >> n;
for(int i = 1; i <= n; i++)
{
fin >> a;
dp += a;
if(a > dp)
{
dp = a;
poz = i;
}
if(dp > ans)
{
ans = dp;
st = poz;
dr = i;
}
}
fout << ans << ' ' << st << ' ' << dr << '\n';
return 0;
}
