Cod sursa(job #456683)

Utilizator alexandru92alexandru alexandru92 Data 16 mai 2010 14:06:58
Problema Ciclu hamiltonian de cost minim Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.77 kb
/* 
 * File:   main.cpp
 * Author: virtualdemon
 *
 * Created on May 16, 2010, 1:47 PM
 */
#include <cstdlib>
#include <fstream>
#include <iterator>
#define Nmax 511
#define oo 1099511627776LL

/*
 * 
 */
using namespace std;
int d[Nmax];
long long int M[Nmax][Nmax];
int main(int argc, char** argv)
{
    int N, i, j, k;
    ifstream in( "podm.in" );
    in>>N;
    copy( istream_iterator<int>(in), istream_iterator<int>(), d );
    for( i=N-1; i > 0; --i )
    {
        M[i][i+1]=1LL*d[i-1]*d[i]*d[i+1];
        for( j=i+2; j <= N; ++j )
        {
            M[i][j]=oo;
            for( k=i; k < j; ++k )
                M[i][j]=min( M[i][j], M[i][k]+M[k+1][j]+1LL*d[i-1]*d[k]*d[j] );
        }
    }
    ofstream out( "podm.out" );
    out<<M[1][N]<<'\n';
    return (EXIT_SUCCESS);
}