Cod sursa(job #2400009)
Utilizator | Data | 8 aprilie 2019 11:28:30 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
int main()
{
int n,st,dr,sum,x,smax=-9999999,drmax,stmax;
cin>>n;
sum=0;
for(int i=1;i<=n;i++)
{
cin>>x;
if(x>sum+x)
{
st=i;
dr=i;
sum=x;
}
else
{
dr=i;
sum=sum+x;
}
if(smax<sum)
{
stmax=st;
drmax=dr;
smax=sum;
}
}
cout<<stmax<<" "<<drmax<<" "<<smax;
}