Pagini recente » Cod sursa (job #2382889) | Cod sursa (job #2665445) | Cod sursa (job #1274825) | Cod sursa (job #3122279) | Cod sursa (job #2932679)
#include <bits/stdc++.h>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
using ll = long long;
const int N = 6e6;
ll dp[N+5],v[N+5];
int main()
{
int n; in>>n;
dp[0]=LONG_MIN;
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]) st=i;
}
}
out<<sum<<' '<<st<<' '<<dr;
}