Pagini recente » Cod sursa (job #786472) | Cod sursa (job #1699352) | Cod sursa (job #2370737) | Cod sursa (job #3275936) | Cod sursa (job #2917217)
#include <bits/stdc++.h>
#pragma GCC optimize ("Ofast")
using namespace std;
ifstream fin ("ssm.in");
ofstream fout ("ssm.out");
const int MAX_N = 6e6 + 5;
int n, v[MAX_N];
int sum, ST, DR;
int sol, solST, solDR;
int main (){
ios_base::sync_with_stdio(false);
fin.tie(nullptr), fout.tie(nullptr);
fin>>n;
for(int i=1; i<=n; i++)
fin>>v[i];
sum = sol = v[1];
ST = DR = solST = solDR = 1;
for(int i=2; i<=n; i++){
if(sum + v[i] >= v[i]){
sum += v[i];
DR = i;
}else{
sum = v[i];
ST = DR = i;
}
if(sum > sol){
sol = sum;
solST = ST;
solDR = DR;
}
}
fout<<sol<<" "<<solST<<" "<<solDR;
return 0;
}