Cod sursa(job #2284358)
Utilizator | Data | 17 noiembrie 2018 10:42:40 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include <climits>
using namespace std;
int main()
{
int maxi,n,v[100001],x,y,s,vmax=INT_MIN,start[100001],i;
v[0]=0;
cin>>n;
for(i=1;i<=n;i++)
{
cin>>v[i];
if(v[i-1]>0)
{
v[i]+=v[i-1];
start[i]=start[i-1];
}
else
start[i]=i;
if(v[i]>vmax)
{
vmax=v[i];
maxi=i;
}
}
cout<<start[maxi]<<' '<<maxi<<' '<<vmax;
return 0;
}