Cod sursa(job #3261526)
Utilizator | Data | 6 decembrie 2024 17:01:54 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <bits/stdc++.h>
using namespace std;
int main()
{
ifstream cin("ssm.in");
ofstream cout("ssm.out");
long long n,x,s=0,max=LLONG_MIN,mi,mj,in=1;
cin>>n;
for(long long int i=1;i<=n;++i)
{
cin>>x;
s+=x;
if(s>max)
{
max=s;
mi=in;
mj=i;
}
if(s<0)
{
s=0;
in=i+1;
}
}
cout<<max<<" "<<mi<<" "<<mj;
return 0;
}