Pagini recente » Cod sursa (job #2192306) | Cod sursa (job #2877983) | Cod sursa (job #1409857) | Cod sursa (job #271912) | Cod sursa (job #2284677)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
//int n,v[100000010],dp[100000010],start[100000010],maxim=1,dmax;
int main()
{
/*in>>n;
for(int i=1;i<=n;i++)
in>>v[i];
dp[1]=v[1];
start[1]=1;
for(int i=2;i<=n;i++)
{
if(dp[i-1]>0)
{
dp[i]=v[i]+dp[i-1];
start[i]=start[i-1];
}
else
{
dp[i]=v[i];
start[i]=i;
}
if(dp[i]>dp[maxim]) maxim=i;
}
out<<dp[maxim]<<" "<<start[maxim]<<" "<<maxim;*/
int n,x=0,last,start=1,stop,startCur,maxim=-10000000;
in>>n;
for(int i=1;i<=n;i++)
{
last=x;
in>>x;
if(last>=0) x+=last;
else start=i;
if(x>maxim)
{
maxim=x;
stop=i;
startCur=start;
}
}
out<<maxim<<" "<<startCur<<" "<<stop;
return 0;
}