Pagini recente » Cod sursa (job #1947062) | Cod sursa (job #987762) | Cod sursa (job #768694) | Cod sursa (job #1287388) | Cod sursa (job #1416722)
#include <cstdio>
#include <algorithm>
#include <fstream>
#include <queue>
#define pii pair <int,int>
#define ll long long
#include <vector>
#include <cstring>
#define inf -2e8
#define pb push_back
using namespace std;
vector <int> g;
int main(){
ifstream cin ("ssm.in");
ofstream cout ("ssm.out");
int n, i, pi, pf, x, maxim, sum;
maxim = inf, sum = 0;
cin >> n;
pi = pf = 1;
for (i = 1 ; i <= n ; i ++ ) {
cin >> x;
sum+=x;
if (sum < 0 ){
pi = i + 1 ;
sum = 0;
}
else {
if (sum > maxim){
maxim = sum;
pf = i;
}
}
}
cout << maxim << " " << pi << " " << pf;
return 0;
}