prettyprint动态规划算法

// Copyright (c) 2004 Broad Institute/Massachusetts Institute of Technology

#include "math/Functions.h"
#include "ueberal/DynProg.h"


void CScoreMatrix::PrettyPrint( int x, int y, bool shade_only )
{
  int i, j;

  if (x == -1)
    x = m_size;

  if (y == -1)
    y = 0;

  cout << "Printing elements from x=" << x << " to y=" << y << "\n";
  for (i=y; i<x; i++) {
    cout << "\n";
    for (j=y; j<x; j++) {
      double val_orig = Get( i, j );
      if ( shade_only )
        cout << ( val_orig > 0 ? "X" : "." );
      else {
        if ( val_orig > 0 && val_orig < 1.0 )
          val_orig = 1.0;
        int val = Min( 99, (int)val_orig );
        cout << setw( 3 ) << val << " ";
      }
    }

  }
  cout << "\n";
}





CDynamicProgramming::CDynamicProgramming()
{
  m_maxGap = -1;
  m_badScore = DP_BADSCORE;
  m_bScoresPos = false;
}

CDynamicProgramming::~CDynamicProgramming()
{
}

void CDynamicProgramming::SetMaxGap(int x)
{
  m_maxGap = x;
}

void CDynamicProgramming::SetScoresArePos(bool b)
{
  m_bScoresPos = b;
  if (b)
    m_badScore = DP_BADSCORE_NEG;
  else