Pagini recente » Cod sursa (job #1408329) | Rating vranau diana (dyana_1993) | Cod sursa (job #3146916) | Cod sursa (job #3289051) | Cod sursa (job #3284010)
#include <fstream>
#define int long long
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n, x[6000005], i, sum, dp[6000005], ans, val;
signed main()
{
fin>>n;
for(i=1; i<=n; i++)
fin>>x[i];
for(i=1; i<=n; i++)
{
dp[i]=max(x[i], dp[i-1]+x[i]);
if(ans<dp[i])
{
ans=dp[i];
val=i;
}
}
int cval=val;
fout<<ans<<" ";
while(ans-x[val]>0)
{
ans-=x[val];
val--;
}
fout<<val<<" "<<cval;
return 0;
}