Cod sursa(job #3200659)
Utilizator | Alex Razvan AlexRzv | Data | 5 februarie 2024 16:27:25 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n;
int bestsmax = INT_MIN, inds, indf;
int main(){
int sum = 0,indsint;
fin >> n;
for(int i = 1;i<=n;++i){
int x;
fin >> x;
if(sum < 0)
sum = x, indsint = i;
else
sum += x;
if(sum > bestsmax)
bestsmax = sum , inds = indsint, indf = i;
}
fout << bestsmax << ' ' << inds << ' ' << indf;
return 0;
}