Cod sursa(job #1759881)
Utilizator | Data | 19 septembrie 2016 22:54:15 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 75 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <bits/stdc++.h>
using namespace std;
long long n, b, bp, c, m, mp, mi, t, s, i1, i2;
int main()
{
ifstream in("ssm.in");
ofstream out("ssm.out");
in >> n;
bp=0;
mp=INT_MAX;
s=INT_MIN;
for(int i=1;i<=n;i++){
in >> c;
b=bp+c;
m=min(mp,b);
if(m==b) mi=i;
t=b-m;
if(t>s) s=t, i1=mi+1, i2=i;
bp=b;
mp=m;
}
out << s << ' ' << i1 << ' ' << i2;
}