Pagini recente » Cod sursa (job #1103673) | Cod sursa (job #430495) | Cod sursa (job #840757) | Cod sursa (job #318809) | Cod sursa (job #1991111)
#include <fstream>
using namespace std;
ifstream fi("ssm.in");
ofstream fo("ssm.out");
//FILE * fi;
int n, i, smax, sum, st, dr, pozf, lg;
int X[6000001];
int main()
{
fi>>n;
for(i=1;i<=n;i++)
fi>>X[i];
for(smax=sum=X[n], st=pozf=n, lg=i=n-1; i>=1; i--)
if(sum<0)
sum=X[i], dr=i; ///incepe o subsecventa noua, deoarece daca sum<0, cu siguranta sum+X[i]<X[i]
else
{
sum += X[i];
if(smax<=sum)
smax=sum, pozf=dr, lg=dr-i+1;
}
fo<<smax<<' '<<pozf-lg+1<<' '<<pozf;
fi.close();
fo.close();
return 0;
}