Cod sursa(job #895386)

Utilizator YoYoxxIftimesei Ioan YoYoxx Data 27 februarie 2013 11:13:09
Problema Subsecventa de suma maxima Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.73 kb
#include <fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
long long int x[6000001];

long long int n;
int maxim(int a,int b)
{
    if(a>b) return a;
    return b;
}
int main()
{
    long long int sg=0,inceput=-1,sfarsit,i,j,sij,final;
   in>>n;
   long long int s[2200000];
   for(i=0;i<n;i++)
   {
       in>>x[i];
   }
   s[0]=x[0];
   for(i=1;i<n;i++)
   {s[i]=maxim(x[i],x[i]+s[i-1]);
       if(sg<s[i])
       {
                  sg=s[i];
           final=i;
       }
   }

   //for(i=0;i<n;i++)
   //{

   //}

i=final;
while(inceput==-1)
{
    if(s[i]<=0) inceput=i;
    i--;
}
out<<sg<<" "<<inceput+2<<" "<<final+1;


   in.close();
   out.close();
return 0;
}