Cod sursa(job #2923917)
| Utilizator | Data | 21 septembrie 2022 11:11:59 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 70 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
const int N=6000001;
int n, v[N], s[N], minim[N], i, maxim=-1, a, b;
int main()
{
fin >> n;
for(i=1;i<=n;i++){
fin >> v[i];
s[i]=s[i-1]+v[i];
minim[i]=min(minim[i-1],s[i]);
}
for(i=2;i<=n;i++){
if(s[i]-minim[i-1]>maxim){
maxim=s[i]-minim[i-1];
b=i;
}
}
for(i=1;i<=n;i++){
if(s[b]-maxim==s[i]){
a=i+1;
break;
}
}
fout << maxim << " " << a << " " << b;
return 0;
}
