Mai intai trebuie sa te autentifici.
Cod sursa(job #2472096)
| Utilizator | Data | 12 octombrie 2019 02:20:16 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 75 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
//
// main.cpp
// SubsecventaMaxima
//
// Created by Darius Buhai on 12/10/2019.
// Copyright © 2019 Darius Buhai. All rights reserved.
//
#include <iostream>
#include <cstdio>
int main() {
int n, s, sum = 0, sp, ep, maxi=0;
freopen("ssm.in", "r", stdin);
freopen("ssm.out", "w", stdout);
scanf("%d\n", &n);
for(int i=0;i<n;i++){
scanf("%d ", &s);
if(sum>=0) sum += s;
else{
sp = i+1;
sum = s;
}
if(sum>maxi){
maxi = sum;
ep = i+1;
}
}
printf("%d %d %d", maxi, sp, ep);
return 0;
}
