Pagini recente » Cod sursa (job #3124152) | Cod sursa (job #907440) | Cod sursa (job #18795) | Cod sursa (job #2389102) | Cod sursa (job #2932680)
#include <bits/stdc++.h>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
using ll = long long;
const int N = 6e6;
int dp[N+5],v[N+5];
int main()
{
int n; in>>n;
dp[0]=-9999999;
ll sum=LONG_MIN;
int st=0,dr=0;
for(int i=1; i<=n; i++)
{
in>>v[i]; dp[i]=max(dp[i-1]+v[i],v[i]);
if(dp[i] > sum) sum=dp[i],dr=i;
if(dp[i-1]+v[i] < v[i] && i<=dr) st=i;
}
out<<sum<<' '<<st<<' '<<dr;
}