Cod sursa(job #2873666)
Utilizator | Data | 19 martie 2022 11:17:15 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <bits/stdc++.h>
using namespace std;
long long int n,v[6000005],i,maxim,minim,st,dr,s;
int main()
{
cin>>n;
for(i=1; i<=n; i++)
{
cin>>v[i];
if(minim>v[i])
{
minim=v[i];
st=i;
}
}
st++;
maxim=v[1];
for(i=st; i<=n; i++)
{
s=s+v[i];
if(s>maxim)
{
maxim=s;
dr=i;
}
}
cout<<maxim<<" "<<st<<" "<<dr;
return 0;
}