Cod sursa(job #2958411)
| Utilizator | Data | 26 decembrie 2022 14:45:12 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
ifstream fin ("ssm.in");
ofstream fout ("ssm.out")
int v[6000005];
int
main ()
{
int ans = -2e9, ps = 0, mn = 0, n, i, d, s=1;
fin>>n;
for (i=1; i<=n; i++) fin>>v[i];
for (int i = 1; i <= n; i++)
{
ps += v[i];
if (ans< ps-mn) d=i;
ans = max(ans, ps - mn);
if (ps<mn) s++;
mn = min(mn, ps);
}
fout<<ans<<" "<<s<<" "<<d;
return 0;
}