Pagini recente » Cod sursa (job #3292180) | Cod sursa (job #2195463) | Borderou de evaluare (job #1566961) | Cod sursa (job #506922) | Cod sursa (job #300325)
Cod sursa(job #300325)
#include<fstream.h>
#define nx 6000005
#define inf 1<<30
int a[nx],best[nx];
int sum=-inf;
int main()
{
ifstream be ("ssm.in");
ofstream ki ("ssm.out");
int n,w=1,e,v,i,s;
be>>n;
e=v=0;
for (i=1;i<=n;++i)
{
be>>a[i];
best[i]=a[i];
if (best[i]<best[i-1]+a[i] && a[i])
{
best[i]=best[i-1]+a[i];
}
else
w=i;
if (sum<best[i])
{
sum=best[i];
e=w;
v=i;
}
}
be.close();
ki<<sum<<" "<<e<<" "<<v<<'\n';
ki.close();
return 0;
}