Pagini recente » Cod sursa (job #192795) | Cod sursa (job #3230715) | Cod sursa (job #1525528) | Cod sursa (job #2088541) | Cod sursa (job #2284388)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int n,v[10000010],dp[10000010],start[10000010],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;
return 0;
}