Cod sursa(job #2071040)
Utilizator | Data | 20 noiembrie 2017 09:42:08 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
using namespace std;
int main()
{
int n=0,x=0,s=0,max=0,p1=1,p2=1,p1m=0,p2m=0;
cin>>n;
for (int i=1; i<=n; i++)
{
cin>>x;
if ((s+x)>0) {s+=x; p2=i;}
else
{
p1=i+1;
s=0;
}
if (s>max) {max=s; p1m=p1; p2m=p2;}
}
cout<<max<<endl<<p1m<<" "<<p2m;
return 0;
}