Cod sursa(job #2604048)
Utilizator | George Dan-Cristian George_Cristian | Data | 21 aprilie 2020 15:47:22 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
long long n,s,smax=LLONG_MIN,inds,indf,cur,x;
int main() {
f>>n;
for (int i = 0; i < n; ++i) {
f>>x;
s=s+x;
if(s>smax)
{
smax=s;
indf=i;
inds=cur;
}
if(s<0)
{
s=0;
cur=i+1;
}
}
g<<smax<<' '<<inds+1<<' '<<indf+1;
return 0;
}