Cod sursa(job #2714990)
Utilizator | Lupau Claudiu ClaudiuAL | Data | 2 martie 2021 19:55:57 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.67 kb |
#include<bits/stdc++.h>
using namespace std;
const int Nmax=6000001;
int v[Nmax];
int n,top=INT_MIN,s;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
fin>>v[i];
s=v[1];
int primu=1, ultimul=1,index;
for(int i=2;i<=n;i++)
{
if(s+v[i]>=v[i])
{
s=s+v[i];
}
else
{
s=v[i];
index=i;
}
if(s>top)
{
top=s;
primu=index;
ultimul=i;
}
}
if(n==1)
top=v[1];
fout<<top<< " "<<primu<< " "<<ultimul;
return 0;
}