Cod sursa(job #3362836)
| Utilizator | Data | 12 august 2026 13:24:17 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.62 kb |
#include <iostream>
#include <fstream>
using namespace std;
long long v,sp[6000001];
int main()
{
ifstream fin ("ssm.in");
ofstream fout ("ssm.out");
int s=0, rst=1, rdr=1, raspmax=-2000000000, i, n, minsp=0;
fin >> n;
for(i = 1; i <= n; i++)
{
fin >> v;
sp[i] = v + sp[i - 1];
}
for(i = 1; i <= n; i++)
{
s = sp[i] - sp[minsp];
if(s > raspmax)
{
raspmax = s;
rst = minsp+1;
rdr = i;
}
if(sp[i] < sp[minsp])
minsp=i;
}
fout << raspmax << " " << rst << " " << rdr;
return 0;
}
