Pagini recente » Cod sursa (job #1849495) | Cod sursa (job #3003182) | Cod sursa (job #973328) | Cod sursa (job #2194046) | Cod sursa (job #2683838)
#include <iostream>
using namespace std;
int v[6000001], dp[6000001], in[6000001], pozm;
int main()
{
int n;
cin>>n;
for (int i=1; i<=n; i++)
cin>>v[i];
dp[1]=v[1];
for (int i=2; i<=n; i++)
{
if (dp[i-1]<0) {in[i]=i; dp[i]=v[i];}
else {in[i]=in[i-1]; dp[i]=dp[i-1]+v[i];}
}
pozm=1;
for (int i=2; i<=n; i++)
{
if (dp[i]>dp[pozm]) pozm=i;
}
cout<<dp[pozm]<<' '<<in[pozm]<<' '<<pozm;
return 0;
}