Pagini recente » Cod sursa (job #2200837) | Cod sursa (job #247491) | Cod sursa (job #229004) | Cod sursa (job #2145257) | Cod sursa (job #983619)
Cod sursa(job #983619)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int best[30001],n,i,x,maxx,in,sf,ccin(1);
int main()
{
f>>n;
for(i=1; i<=n; i++)
{
f>>x;
if (best[i-1]+x>x) best[i]=best[i-1]+x;
else best[i]=x,ccin=i;
if (best[i]>maxx) maxx=best[i],sf=i,in=ccin;
else if (best[i]==maxx && i-ccin<sf-in) sf=i,in=ccin;
}
g<<maxx<<" "<<in<<" "<<sf;
return 0;
}