Cod sursa(job #1889646)
| Utilizator | Data | 22 februarie 2017 20:19:46 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int n,x,beg,en;
ll s,s1;
int main()
{
// ifstream cin("ssm.in");
// ofstream cout("ssm.out");
cin>>n;
cin>>x;
s=x;
s1=x;
beg=1;
en=1;
for(int i=2;i<=n;i++)
{
cin>>x;
if(x>=0&&s1<0) {
beg=i;
s=x;
s1=x;
en=i;
continue; }
s1+=x;
if(s1>s) {
en=i;
s=s1;
}
}
cout<<s<<" "<<beg<<" "<<en;
return 0;
}
