Pagini recente » Cod sursa (job #1823288) | Cod sursa (job #2747003) | Cod sursa (job #1985069) | Cod sursa (job #3189778) | Cod sursa (job #1525668)
//#include <iostream>
#include<fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
long long int b[6000001],a[2][6000001];
int main()
{
int n,i,r,mini,z,maxi;
f>>n;
for(i=1;i<=n;i++)
f>>b[i];
for(i=n-1;i>=1;i--)
b[i]+=b[i+1];
a[0][n]=b[n];
a[1][n]=n+1;
r=1;
mini=0;
z=n;
maxi=a[0][1];
for(i=n-1;i>=1;i--)
{
if(b[i+1]<=mini)
{
mini=b[i+1];
z=i;
}
a[0][i]=b[i]-mini;
a[1][i]=z;
}
for(i=2;i<=n;i++)
{
if(maxi<a[0][i])
{
r=i;
maxi=a[0][i];
}
}
g<<a[0][r]<<" "<<r<<" "<<a[1][r];
f.close();
g.close();
return 0;
}