Pagini recente » Cod sursa (job #1436895) | Cod sursa (job #12955) | Cod sursa (job #1923154) | Cod sursa (job #369928) | Cod sursa (job #2503882)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in ("ssm.in");
ofstream out ("ssm.out");
const int N=6000002;
long long s[N];
int main()
{
int n,x;
in>>n;
int minn=0,isum=0,inc,sf,smax=0;
for (int i=1;i<=n;i++)
{
in>>s[i];
s[i]+=s[i-1];
if (s[i]-minn>smax)
{
smax=s[i]-minn;
inc=isum+1;
sf=i;
}
if (minn>s[i])
{
minn=s[i];
isum=i;
}
}
out<<smax<<' '<<inc<<' '<<sf;
return 0;
}