Cod sursa(job #3370549)
| Utilizator | Data | 26 octombrie 2026 14:59:56 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include <iostream>
#include <fstream>
using namespace std;
int a[6000000];
int main()
{
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n, i, j;
fin>>n;
for(i=1; i<=n; i++){
fin>>a[i];
}
int mg = a[1], p=1, l=1, st=1;
int s=a[1];
for(i=2; i<=n; i++){
if(s + a[i] >= a[i]){
s = s+a[i];
}else{
s = a[i];
st=i;
}
mg = max(mg, s);
if(s==mg){
l = i;
p=st;
}
}
s=mg;
fout<<s<<" "<<p<<" "<<l;
return 0;
}