Pagini recente » Cod sursa (job #1993611) | Cod sursa (job #976954) | Cod sursa (job #2530715) | Cod sursa (job #1488782) | Cod sursa (job #1571250)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
long long x,dp[6000000], Min=(int)(2e9), Max=-(int)(2e9), sum=0, MinI, MaxI, n;
int main()
{
in>>n;
for(int i=1;i<=n;i++)
{
in>>x;
sum+=x;
dp[i]=sum;
if(dp[i]<Min)
{
Min = dp[i];
MinI= i;
}
if(dp[i]>Max)
{
Max = dp[i];
MaxI= i;
}
}
out<<dp[MaxI]-dp[MinI]<<' '<<MinI+1<<' '<<MaxI;
return 0;
}