Cod sursa(job #2776703)
| Utilizator | Data | 20 septembrie 2021 19:20:46 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
typedef long long ll;
ll n,x,scurr,minim,poz,
smax,ist,ifin,m=-2e9-7,u;
int main()
{
in>>n;
for(ll i=1;i<=n;++i)
{
in>>x;
scurr+=x;
if(x>m)
m=x,u=i;
if(scurr-minim>smax)
smax=scurr-minim,
ist=poz+1,ifin=i;
if(scurr<minim)
minim=scurr,
poz=i;
}
if(m<=0)
out<<m<<' '<<u<<' '<<u<<'\n';
else out<<smax<<' '<<ist<<' '<<ifin<<'\n';
return 0;
}
