Pagini recente » Cod sursa (job #2233504) | Cod sursa (job #959780) | Cod sursa (job #1214227) | Cod sursa (job #2359748) | Cod sursa (job #3142274)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
const int N=6000005;
int dp[N];
int a[N];
int n;
int maxi(int a, int b)
{
if(a>=b)
return a;
else
return b;
}
int main()
{
fin>>n;
for(int i=1; i<=n; i++)
fin>>a[i];
for(int i=1; i<=n; i++)
{
dp[i]=maxi(dp[i-1]+a[i], a[i]);
}
int maxi=-1, l;
for(int i=1; i<=n; i++)
{
if(dp[i]>maxi)
{
maxi=dp[i];
l=i;
}
}
fout<<maxi<<" ";
int s=0;
for(int i=l; i>=1; i--)
{
s+=a[i];
if(s==maxi)
{
fout<<i<<" "<<l;
break;
}
}
return 0;
}