Cod sursa(job #3165391)
Utilizator | Data | 6 noiembrie 2023 09:07:40 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 15 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int s,v[6000001],x,n,poz1,poz2,cmax;
int main()
{
fin>>n;
for(int i=1; i<=n; i++)
fin>>v[i];
s=v[1];
poz1=1;
for(int i=2; i<=n; i++)
{
if(s+v[i]>v[i])
{
if(s+v[i]>cmax)
poz2=i;
s=s+v[i];
}
else if(s+v[i]<v[i])
{
poz1=i;
s=v[i];
}
cmax=max(s,cmax);
}
fout<<cmax<<" "<<poz1<<" "<<poz2;
}