Cod sursa(job #2303912)
| Utilizator | Data | 17 decembrie 2018 10:51:40 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
int n,v[6000001];
int st,dr,sum;
int main()
{
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
cin>>n;
st=1;dr=1;
cin>>v[1];
for (int i=2 ; i<=n ; i++)
{
cin>>v[i];
v[i]=v[i]+v[i-1];
if (v[i]<0)
{
st=i+1;
v[i]=0;
dr=i+1;
}
if (v[i]>sum)
{
sum=v[i];
dr++;
}
}
cout<<sum<<" "<<st<<" "<<dr;
return 0;
}
