Pagini recente » Cod sursa (job #2577234) | Cod sursa (job #2656917) | Cod sursa (job #2460776) | Cod sursa (job #1779651) | Cod sursa (job #806697)
Cod sursa(job #806697)
#include<fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int best[6000001],v[6000001],n,i;
void sir ()
{
int m=0,im,jm;
best[1]=v[1];
for(i=2;i<=n;i++)
{
if(best[i-1]+v[i]>=v[i])
best[i]=best[i-1]+v[i];
else
{
im=i;
best[i]=v[i];
}
}
for(i=1;i<=n;i++)
if(best[i]>=m)
{
jm=i;
m=best[i];
}
g<<m<<" "<<im<<" "<<jm;
}
int main ()
{
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
sir();
f.close();g.close();
return 0;
}