Pagini recente » Borderou de evaluare (job #2848693) | Istoria paginii algoritmiada-2012/runda-1/clasament/11-12 | Autentificare | Cod sursa (job #2767751) | Cod sursa (job #1072541)
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int best[6000000],a[6000000];
int main()
{
int i,n,k,smax=0,poz,j,st=1,sf;
f>>n;
f>>a[1];
best[1]=a[1];
for(i=2;i<=n;i++)
{
f>>a[i];
k=best[i-1]+a[i];
if(k<a[i])
best[i]=a[i], st=i;
else
best[i]=k;
if(smax<best[i])
smax=best[i],sf=i;
}
g<<smax<<" ";
g<<st<<" "<<sf<<'\n';
return 0;
}