Pagini recente » Cod sursa (job #561711) | Cod sursa (job #2932304) | Cod sursa (job #601254) | Cod sursa (job #1077471) | Cod sursa (job #3167581)
#include <bits/stdc++.h>
using namespace std;
pair<int,int> a[6000001];
int main(void){
ofstream cout("ssm.out");
ifstream cin("ssm.in");
int n, x;
cin >> n >> x;
a[1].first = x;
a[1].second = 1;
for(int i = 2;i<=n;i++){
cin >> x;
if(a[i-1].first + x >= x){
a[i].first = a[i-1].first + x;
a[i].second = a[i-1].second;
}else if(a[i-1].first + x <= x){
a[i].first = x;
a[i].second = i;
}
}
int maxim = -1,pp = 0, p1 = 0;
for(int i = 1;i<=n;i++){
if(a[i].first >= maxim){
maxim = a[i].first;
pp = a[i].second;
p1 = i;
}
}
cout << maxim << ' ' << pp<< ' ' << p1 << '\n';
}