Cod sursa(job #2632684)
| Utilizator | Data | 4 iulie 2020 13:24:11 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 90 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n,v[6000005],st,dr,indice,mmax=-1;
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
fin>>v[i];
int s=0;
for(int i=1;i<=n;i++)
{
if(s+v[i]>v[i])
{
s=s+v[i];
}
else
{
s=v[i];indice=i;
}
if(s>mmax)
{
mmax=s;st=indice;dr=i;
}
}
fout<<mmax<<' '<<st<<' '<<dr;
return 0;
}
