Cod sursa(job #2472207)
| Utilizator | Data | 12 octombrie 2019 10:30:09 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.4 kb |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
ll n, s, maxim=-1e9, a, b, x, p;
int main()
{
f>>n;
for(int i=1; i<=n; i++)
{
f>>x;
if(x>s+x)
s=x, p=i;
else
s=s+x;
if(s>maxim)
maxim=s, a=p, b=i;
}
g<<maxim<<' '<<a<<' '<<b;
return 0;
}
