Pagini recente » Cod sursa (job #1519958) | Cod sursa (job #2418506) | Statistici tester (teapa) | Cod sursa (job #1676636) | Cod sursa (job #268677)
Cod sursa(job #268677)
#include<fstream>
using namespace std;
int n,i,j,p,u,best=-int(2e9),s[6000010],minim;
int main()
{
ifstream f("ssm.in");
ofstream g("ssm.out");
f>>n;
for(i=1;i<=n;i++) f>>s[i];
for(i=1;i<=n;i++)
{ s[i]+=s[i-1];
if(best<s[i]-minim) { best=s[i]-minim; p=j+1; u=i;}
if(minim>s[i]) {minim=s[i]; j=i;}
}
g<<best<<" "<<p<<" "<<u;
f.close();
g.close();
return 0;
}