Cod sursa(job #2288402)
Utilizator | Data | 23 noiembrie 2018 12:30:47 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 85 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <bits/stdc++.h>
using namespace std;
int s[6000000];int n;int suma,inc,sf,smax;
ifstream fi("ssm.in");
ofstream fo("ssm.out");
int main(){
fi>>n;
for (int i=1;i<=n;i++) fi>>s[i];
smax=s[1];
suma=s[1];
for (int i=2;i<=n;i++){
if(suma>=0) {suma+=s[i];} else {suma=s[i];inc=i;}
if(suma>smax){
sf=i;
smax=suma;
}
}
fo<<smax<<" "<<inc<<" "<<sf;
}