Cod sursa(job #2428271)
Utilizator | Capmare Alex capmareAlex | Data | 4 iunie 2019 15:19:40 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.62 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n;
int main()
{
fin>>n;
long long mx=0;
int l,r,lf,rf;
l=r=1;
long long sol=INT_MIN;
long long premx=0;
for(int i=1;i<=n;++i)
{
long long x;
fin>>x;
long long mx=x;
if(x>premx+x)
{
premx=x;
l=i;
r=i;
}
else
{
premx=premx+x;
l=i;
}
if(premx>sol){sol=premx;lf=l;rf=r;}
}
fout<<sol<<" "<<rf<<" "<<lf;
return 0;
}