Cod sursa(job #2515201)
Utilizator | Data | 28 decembrie 2019 01:11:56 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int main(){
long long n,x,i,s=0,m=-LLONG_MAX,p1=0,p2=0,j;
in>>n;
for(i=1, j=1; i<=n; ++i){
in>>x;
s+=x;
if(m<s)
m=s, p1=j, p2=i;
if(s<0)
s=0, j=i+1;
}
out<<m<<" "<<p1<<" "<<p2;
return 0;
}