Pagini recente » Cod sursa (job #3219581) | Cod sursa (job #366750) | Cod sursa (job #1098348) | Cod sursa (job #1014831) | Cod sursa (job #3174493)
#include <iostream>
using namespace std;
int main()
{
freopen("ssm.in", "r", stdin);
freopen("ssm.out", "w", stdout);
int n;
cin>>n;
int v[n+1];
for(int i=1; i<=n; i++)
cin>>v[i];
int dp[n+1], l[n+1];
dp[0]=l[0]=0;
int suma_max=0;
for(int i=1; i<=n; i++)
{
dp[i]=dp[i-1]+v[i];
l[i]=l[i-1]+1;
if(dp[i]<=0)
dp[i]=0, l[i]=0;
suma_max=max(suma_max, dp[i]);
}
cout<<suma_max<<' ';
for(int i=1; i<=n; i++)
if(dp[i]==suma_max)
{
cout<<i-l[i]+1<<' '<<i;
return 0;
}
return 0;
}