Cod sursa(job #2757075)
| Utilizator | Data | 3 iunie 2021 19:54:38 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 10 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include<fstream>
using namespace std;
ifstream cin("ssm.in");
ofstream cout("ssm.out");
int n, a[1001], maxi, st, dr;
int main(){
cin >> n;
for(int i = 1; i <= n; ++i)
cin >> a[i];
int sumMax = 0;
for(int i = 1; i <= n; ++i){
sumMax += a[i];
if(sumMax < 0)
sumMax = 0, st = i;
else if(sumMax > maxi)
maxi = sumMax, dr = i;
}
cout << maxi << ' ' << st + 1 << ' ' << dr;
return 0;
}
