Pagini recente » Cod sursa (job #2248627) | Cod sursa (job #2871084) | Cod sursa (job #586165) | Cod sursa (job #2768300) | Cod sursa (job #1313266)
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int dp[6000003], in[6000003];
int main()
{
int n,i,x,max=0,min=0,c=0;
fin>>n;
fin>>x;
dp[1]=x; in[1]=x;
for(int i=2;i<=n;i++)
{ fin>>x;
if(dp[i-1]+x>=x)
{dp[i]=dp[i-1]+x;
in[i]=in[i-1];
}
else {dp[i]=x;in[i]=x;}
}
max=dp[1]; min=in[1];
for(i=2;i<=n;i++)
if(dp[i]>max) {max=dp[i]; min=in[i]; c=i;}
fout<<max<<" "<< min<<" "<<c;
return 0;
}