Cod sursa(job #2754521)
Utilizator | Data | 25 mai 2021 23:12:16 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
long long n,s,smax,Min,p,cr,x,l,r,best[6000005];
int main()
{
in>>n;
Min=0;
smax=-1e10;
for(int i=1;i<=n;i++)
{
in>>x;
cr+=x;
best[i]=s-Min;
if(best[i]>smax)
{
smax=best[i];
l=p;
r=i;
}
if(cr<Min)
{
Min=cr;
p=i+1;
}
}
out<<smax<<" "<<l<<" "<<r;
return 0;
}