Pagini recente » Cod sursa (job #3231897) | Cod sursa (job #2706504) | Borderou de evaluare (job #508769) | Cod sursa (job #2684904) | Cod sursa (job #2508668)
#include <bits/stdc++.h>
#define ll long long
#define all(a) (a).begin(), (a).end()
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define sz() size()
#define fr first
#define sc second
#define pb push_back
#define er erase
#define in insert
#define pi pair<int,int>
#define pii pair<pair<int,int>,int>
#define mp make_pair
//#define int long long
#define rc(s) return cout<<s,0
#define rcc(s) cout<<s,exit(0)
using namespace std;
const int mod=1e9+7;
const int modx=998244353;
const int per=666013;
int n,beg,ans=INT_MIN,tz1,tz2;
int32_t main(){
// ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
srand(chrono::steady_clock::now().time_since_epoch().count());
ifstream fin("ssm.in");
ofstream fout("ssm.out");
fin >> n;
int sum=INT_MIN;
for(int i=1;i<=n;i++){
int x;
fin >> x;
if(sum<0){
sum=x;
beg=i;
}
else sum+=x;
if(ans<sum){
ans=sum;
tz1=beg;
tz2=i;
}
}
fout << ans << ' ' << tz1 << ' ' << tz2 << '\n';
}