Pagini recente » Cod sursa (job #235374) | Cod sursa (job #2442216) | Cod sursa (job #1785108) | Cod sursa (job #515923) | Cod sursa (job #2926218)
#include <bits/stdc++.h>
using namespace std;
pair<int,int> a[6000001];
int main()
{
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 << a[i].first << ' ' << a[i].second << endl;
}
cout << maxim << ' ' << pp << ' ' << p1;
}