Cod sursa(job #478225)

Utilizator crouchHotea Cristian crouch Data 17 august 2010 20:59:47
Problema Subsecventa de suma maxima Scor 85
Compilator cpp Status done
Runda Arhiva educationala Marime 0.61 kb
#include <fstream>

using namespace std;
int n,k,x,y,aux,s[6000001],b[6000001],t,pozmin,pozmax,st,dr;
int main()
{
  ifstream f("ssm.in",ios::in);
  ofstream g("ssm.out",ios::out);
  f>>n;
  int max=-2147483647;
  int min=2147483647;
  for(int i=1;i<=n;i++)
    {
     f>>x;
     s[i]=s[i-1]+x;
    }
    min=s[1];
    for(int i=1;i<=n;i++)
    {
        if(s[i]<min)
        {b[i]=s[i];
        min=s[i];
        st=i;}
        else
        b[i]=min;

    }
    for(int i=1;i<=n;i++)
    if(s[i]-b[i]>max)
    {max=s[i]-b[i];
    dr=i;}
    g<<max<<" "<<st+1<<" "<<dr;

    }