Pagini recente » Borderou de evaluare (job #1305655) | Borderou de evaluare (job #2510191) | Borderou de evaluare (job #20797) | Cod sursa (job #1939572) | Cod sursa (job #413389)
Cod sursa(job #413389)
#include<fstream>
#include<stdio.h>
using namespace std;
/*ifstream f("suma.in");
ofstream g("suma.out"); */
int main ()
{
long long n,i,a[100001],v[100001],nr,best=-99999999,j,poz1,poz2,min,p_min;
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
scanf("%lld",&n);
a[0]=0;
for (i=1; i<=n; i++)
{
scanf("%lld",&v[i]);
a[i]=a[i-1]+v[i];
}
min=999999999;
for (i=1; i<n; i++)
{
if (a[i]-min>best) { best=a[i]-min; poz1=p_min+1; poz2=i; }
if (a[i]<min) { min=a[i]; p_min=i; }
}
printf("%lld\n",best);
for (i=poz1; i<=poz2; i++)
printf("%lld ",v[i]);
return 0;
}