Pagini recente » Cod sursa (job #1284543) | Cod sursa (job #479833) | Cod sursa (job #2104492) | Cod sursa (job #2022449) | Cod sursa (job #1650876)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
const int NMax = 6000005;
int x[NMax],DP[NMax];
int n,Sol=-2000000000,Start,Finish;
int main()
{
int Begin=1,i;
fin>>n;
for(i=1;i<=n;i++)
fin>>x[i];
for(i=1;i<=n;i++)
{
if(DP[i-1]+x[i]>=x[i])
DP[i]=DP[i-1]+x[i];
else
{
DP[i]=x[i];
Begin=i;
}
if(DP[i]>Sol)
{
Sol=DP[i];
Start=Begin;
Finish=i;
}
}
fout<<Sol<<" "<<Start<<" "<<Finish;
}