Pagini recente » Borderou de evaluare (job #226502) | Cod sursa (job #1385913) | Cod sursa (job #2897554) | Cod sursa (job #84646) | Cod sursa (job #1477265)
#include<fstream>
using namespace std;
fstream f("ssm.in",ios::in);
fstream g("ssm.out",ios::out);
int n,i,a[6000000],bestSum,best[6000000],t,suma,k,p,r,j;
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
bestSum=a[1];
for(i=1;i<=n;i++)
{
best[i]=a[i];
if(best[i]<best[i-1]+a[i])
best[i]=best[i-1]+a[i];
if(bestSum<best[i])
{
bestSum=best[i];
t=i;}}
suma=bestSum;
p=t;
while(suma)
{
suma=suma-a[p];
k=p;
p--;}
g<<bestSum<<" "<<k<<" "<<t;
return 0;}