Pagini recente » Cod sursa (job #1731870) | Cod sursa (job #2854554) | Istoria paginii summer-challenge-2019/solutii/alambicare | Cod sursa (job #798291) | Cod sursa (job #2284464)
#include <iostream>
#include <fstream>
using namespace std;
long long int n ,v[60000],dp[60000] ,start[60000],maxi=1 ,i;
int main()
{
ifstream fin("ssm.in");
ofstream fout("ssm.out");
fin>>n;
dp[1]=v[1];
start[1]=1;
for(i=1 ;i<=n ; i++)
fin>>v[i];
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[maxi])
maxi=i;
}
fout<<dp[maxi]<<" "<<start[i-1]<<" "<<maxi;
return 0;
}