Cod sursa(job #1268768)
Utilizator | Data | 21 noiembrie 2014 14:13:32 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
using namespace std;
int n,x,i,s,smax,p,u,pm;
int main()
{
cin>>n>>x;
s=x;
smax=x;
p=1;pm=1;u=1;
for (i=2; i<=n; i++){
cin>>x;
if (s+x>=x) s=s+x;
else {
s=x;
p=i;}
if (s>smax) {
smax=s;
pm=p;u=i;}
else {
if (s==smax) {
if (u>i) u=i;
}
}
}
cout<<smax<<" "<<pm<<" "<<u;
return 0;
}