Pagini recente » Cod sursa (job #2840006) | Cod sursa (job #1535979) | Cod sursa (job #1901743) | Cod sursa (job #1195864) | Cod sursa (job #2284386)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g ("ssm.out");
int main()
{
int n,i,v[1001],maxim=1,dp[1001],start[1001];
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
dp[1]=v[1];
start[1]=1;
for(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;
}
g<<start[maxim]<<' '<<maxim<<' '<<dp[maxim];
return 0;
}