Pagini recente » Cod sursa (job #2351035) | Cod sursa (job #2267481) | Rating Marton Alexandru-Sergiu (zazavatar12) | Cod sursa (job #2395747) | Cod sursa (job #488724)
Cod sursa(job #488724)
#include <fstream>
using namespace std;
const char InFile[]="ssm.in";
const char OutFile[]="ssm.out";
const int MaxN=6000005;
ifstream fin(InFile);
ofstream fout(OutFile);
int vi,best[MaxN],st[MaxN],sol,maxsol,n;
int main()
{
fin>>n;
fin>>vi;
best[1]=vi;
st[1]=1;
for(register int i=2;i<=n;++i)
{
fin>>vi;
if(best[i-1]>=0)
{
best[i]=best[i-1]+vi;
st[i]=st[i-1];
}
else
{
st[i]=i;
best[i]=vi;
}
}
fin.close();
maxsol=best[1];
sol=1;
for(register int i=2;i<=n;++i)
{
if(best[i]>maxsol)
{
maxsol=best[i];
sol=i;
}
}
fout<<best[sol]<<" "<<st[sol]<<" "<<sol;
fout.close();
return 0;
}