Cod sursa(job #3220309)
Utilizator | Data | 3 aprilie 2024 09:28:15 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
using namespace std;
int main()
{
int n,i,v[100001],smax=-1,s=0,imin=10000,imax=0;
cin>>n;
for(i=1;i<=n;i++)
{
cin>>v[i];
}
for(i=1;i<=n;i++)
{
imin=i;
if(s<0)
{
s=0;
imax=i-1;
imin=0;
}
s+=v[i];
if(s>smax)
{
smax=s;
}
}
cout<<smax<<" "<<imax+1<<" "<<imin-1;
return 0;
}