Cod sursa(job #458891)

Utilizator liviu12345Stoica Liviu liviu12345 Data 26 mai 2010 20:49:11
Problema Subsecventa de suma maxima Scor 60
Compilator cpp Status done
Runda Arhiva educationala Marime 0.81 kb
#include <iostream>
#include <fstream>

const long long MAXN = 6e+6 ;

using namespace std ;

ifstream f ( "ssm.in" ) ;
ofstream g ( "ssm.out" ) ;

long long secventa [ MAXN ] , suma [ MAXN ] ;
long long nrNumere , maximum ;

long long maxEu ( long long a , long long b )
{
  if ( a > b )
    return a ;
  return b ;
}

void citireFisier ( ) 
{
  f >> nrNumere ;
  for ( long long i = 1 ; i <= nrNumere ; i++ )
  {
    f >> secventa [ i ] ;
    suma [ i ] = maxEu ( 0 , suma [ i - 1 ] ) ;
    suma [ i ] += secventa [ i ] ;
    if ( suma [ maximum ] < suma [ i ] )
      maximum = i ;
  }
}

int main ( )
{
  citireFisier ( ) ;
  long long S ;
  g << suma [ maximum ] << " " ;
  long long i = maximum ;
  S = suma [ maximum ] ;
  while ( S > 0 )
    S -= secventa [ i -- ] ;
  g << i + 1 << " " << maximum << endl ;
  return 0 ;
}