Cod sursa(job #2683638)
| Utilizator | Data | 11 decembrie 2020 20:33:50 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 95 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <fstream>
using namespace std;
ifstream cin("ssm.in");
ofstream cout("ssm.out");
int v[6000001];
int main()
{
int n,summax=0,stmax=0,drmax=0;
cin>>n;
for(int i=1; i<=n; i++)
cin>>v[i];
int s=0;
int st=1, dr=1;
for(int i=1; i<=n; i++)
{
if(s>=0)
{
s+=v[i];
dr++;
}
else
{
s=v[i];
st=i;
dr=i;
}
if(s>summax)
{
summax = s;
stmax = st;
drmax = dr;
}
}
cout<<summax<<" "<<stmax<<" "<<drmax;
return 0;
}
