Cod sursa(job #2878743)
Utilizator | Data | 27 martie 2022 15:20:56 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in ("ssm.in");
ofstream out ("ssm.out");
int n,x,S,maxim,st,dr,N,st1,dr1;
int main()
{
in>>n;
in>>S;
maxim=S;
st1=st=1;
dr1=dr=1;
for (int i=2; i<=n; i++){
in>>x;
dr1=i;
S+=x;
if (S>maxim){
maxim=S;
st=st1;
dr=dr1;
}
if (S<0){
st1=i+1;
S=0;
}
}
out<<maxim<<" "<<st<<" "<<dr;
}