Cod sursa(job #1800095)
Utilizator | Marius Radu waren4 | Data | 7 noiembrie 2016 12:41:23 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <iostream>
using namespace std;
int main()
{
int n,j,x,y,i; int a[1000]; int m,s;
cin>>n;
for(i=1;i<=n;i++) {cin>>a[i];}
i=1;
m=0;
s=0;
i=1;
j=1;
while(i<=n)
{
s=s+a[i];
if (s>m) {m=s;x=j;y=i;}
if (s<0) {s=0;j=i+1;}
i++;
}
cout<<m<<" "<<x<<" "<<y;
return 0;
}