Cod sursa(job #3202997)
Utilizator | Data | 12 februarie 2024 20:30:07 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
using namespace std;
typedef long long lint;
lint n,a[1000],nr ,produs,p,u,x,s,maxi,st=1,stm,etm;
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
{cin>>x;
s+=x;
if(s>maxi){
maxi=s;
stm=st;
etm=i;
}
if(s<0)
{
s=0;
st=i+1;
}
}
cout<<maxi<<' '<<stm<<' '<<etm;
return 0;
}