Cod sursa(job #2367858)
Utilizator | Data | 5 martie 2019 12:33:26 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
long long n,Min=1e10,s,x,l,Max=-1e10,p,r;
int main()
{
in>>n;
for(int i=1;i<=n;i++)
{
in>>x;
s+=x;
if(s<Min) Min=s,p=i+1;
if(s-Min>Max)
{
Max=s-Min;
l=p;
r=i;
}
}
out<<Max<<" "<<l<<" "<<r;
return 0;
}