Cod sursa(job #2741176)
Utilizator | Data | 15 aprilie 2021 17:33:22 | |
---|---|---|---|
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, s=0, smax=0, x, pi=1, pf=1, p1m=0, p2m=0;
cin>>n;
for(int i=1; i<=n; i++)
{
cin>>x;
if(s+x>0)
{
s=s+x;
}
else
{
s=x;
pi=i;
}
if(smax<s)
{
smax=s;
p1m=pi;
p2m=i;
}
}
cout<<smax<<p1m<<" "<<p2m;
return 0;
}