• <ins id="pjuwb"></ins>
    <blockquote id="pjuwb"><pre id="pjuwb"></pre></blockquote>
    <noscript id="pjuwb"></noscript>
          <sup id="pjuwb"><pre id="pjuwb"></pre></sup>
            <dd id="pjuwb"></dd>
            <abbr id="pjuwb"></abbr>

            DraculaW

              C++博客 :: 首頁 :: 新隨筆 :: 聯系 :: 聚合  :: 管理 ::
              19 隨筆 :: 0 文章 :: 7 評論 :: 0 Trackbacks

            #

                 摘要: 我嘗試寫的一個智能指針
            希望大家能幫我提一些意見 謝謝

            上面是測試碼
            下面是代碼  閱讀全文
            posted @ 2008-11-28 17:39 DraculaW 閱讀(403) | 評論 (0)編輯 收藏

                 摘要: 紅黑樹的插入算法的描述 不知道清楚么 希望大家指正  閱讀全文
            posted @ 2007-11-22 20:47 DraculaW 閱讀(315) | 評論 (0)編輯 收藏

                 摘要: 對內存分配算法的一點想法 希望大家指正  閱讀全文
            posted @ 2007-11-21 22:38 DraculaW 閱讀(1966) | 評論 (1)編輯 收藏

                 摘要: 大概的介紹了下deque的實現
            為什么要用這種實現方式 誰能解釋一下  閱讀全文
            posted @ 2007-11-20 22:30 DraculaW 閱讀(1164) | 評論 (0)編輯 收藏

            template<typename T, typename U>
            class Conversion
            {
                typedef char Small;
                class Big{char dummy[2];};
                static Small Test(U)    {   }  
                static Big Test(...) { }  
                static T MakeT() { }
               
            public:
                enum { exists = sizeof(Test(MakeT())) == sizeof(Small)};   
            };

            如果T可以轉換為U 于是就調用Test(U)這個函數 返回一個char;
            如果不能 就調用使用(...)缺省參數的函數 返回一個數組

            然后對返回值進行判斷....
            posted @ 2007-11-15 20:45 DraculaW 閱讀(271) | 評論 (0)編輯 收藏

                 摘要: STL與boost的type traits  閱讀全文
            posted @ 2007-11-15 20:43 DraculaW 閱讀(937) | 評論 (0)編輯 收藏

            # The readfpl accept a file's path while is fpl(foobar play list),
            # and return a list which holds all the file'path
            sub readfpl
            {
                my @files;
                my @chunks;
                my $index = 0;

                open(INPUT, "< $_[0]")
                    or die "can't open";

                @chunks = split(m{file://}, <INPUT>);

                foreach(@chunks)
                {   
                    if($_ =~ m/.+\.(mp3|wma|m4a)/)
                    {
                        $files[$index] = $&;
                        $index ++;
                    }
                }

                print $files[0];
               
                return @files;
            }

            my @files = readfpl($ARGV[0]);
            my $string;

            foreach(@files){
                 $string = $_;
                    # the next while get name from path
                 while( substr($string, 1) =~ m{\\.+\.(mp3|wna|m4a)}) {
                     $string = $ARGV[0].$&;
                     }
                 rename $_, string;
            }

            將這段代碼存為movefpl.pl然后在命令行打入 movefpl.pl 播放列表的全路徑 要存歌曲的新路徑
            就可以了呢 呵呵
            posted @ 2007-11-15 20:41 DraculaW 閱讀(302) | 評論 (0)編輯 收藏

            Assessing Infection

            Background

            According to the World Health Organization, infectious disease ranks as the leading cause of death in the world. In 1998 alone, over 17 million people died from infectious and parasitic diseases such as acute lower respiratory infections, tuberculosis, HIV/AIDS, and malaria. It is forecast that infectious disease will continue to kill millions of people, especially those living in developing countries.

            The medical profession and scientific community of the world are fighting the infectious disease threat with new tools and technologies from a variety of fields. From this effort, a new field of research has emerged. Infectious Disease Epidemiology is the study of the variables that influence the growth and spread of infectious diseases. This relatively new field combines molecular biology, immunology, genetics, and the computational sciences. A focus of this field is the study of the factors that influence the growth of an infectious disease within a single organism, and the factors that influence the pattern of infection across an entire population.

            Description

            This assignment asks you to finish the implementation of a program that assesses the level of infection in a tissue sample. You are given data representing a rectangular tissue sample, overlaid with a grid. Certain portions of the tissue are infected; others are not. Your goal is to help assess the extent of the infection by writing a program that, given the coordinates of a colony of infection, can determine its size.

            A typical use of the program follows. The user interacts with the program only through command-line arguments. The user supplies to the program a data filename and the coordinates of a cell in the grid. The coordinates are specified by row and then column, both starting at zero. The program calculates the extent of infection at that coordinate and outputs a two-dimensional representation of the tissue sample. Figure 1 depicts the execution of the program.

            A screen shot from a sample solution
            Figure 1 Output from a sample solution

            For the purpose of this assessment, we consider a "colony" of infected tissue to be a set of adjacent and infected cells. In Figure 1, we can see three separate colonies. The smallest colony consists of two cells and is located in the lower left corner of the grid. Another colony consisting of three infected cells exists on the far right edge of the grid. The largest colony of eight cells resides primarily in the middle of the grid. This colony has a small arm into the upper left corner of the grid. Notice from this colony that cells residing in diagonals are considered "adjacent." The plus signs next to the cells in this largest colony indicate that they all belong to the colony that contains the user entered coordinate.


            solution :

            #ifndef GRID_H
            #define GRID_H

            #include <string>
            #include <vector>

            using namespace std;

            /*
            * IMPORTANT NOTE:
            *
            * For this assignment, you might need to add state to the
            * class and/or augment existing methods, and/or create private helper
            * methods, but you should not delare new public methods
            */

            const bool INFECTED = true;
            const bool NOT_INFECTED = false;

            class grid;

            class grid {

            private:
                int rows;
                int cols;
                vector<bool> *area;
                vector<bool> *infect;
                int indexof (int row, int col) const;
                bool infected(int row, int col) const;

            public:
                grid (string file);
                ~grid ();

                int count (int row, int col);

                friend ostream &operator<<(ostream &stream, const grid& ob);

            };

            #endif

            ============================================================================

            #include <iostream>
            #include <fstream>

            using namespace std;

            #include "grid.h"

            // You do not need to alter function indexof.
            int grid::indexof (int row, int col) const {
                return row*cols+col;
            }

            // You do not need to alter function infected.
            bool grid::infected(int row, int col) const {
                return (area->operator[](indexof(row, col)) == INFECTED);
            }

            // You may need to alter the constructor
            grid::grid (string file) {

                ifstream grid_file;

                grid_file.open (file.c_str());

                grid_file >> rows;
                grid_file >> cols;

                area = new vector<bool>(rows*cols, NOT_INFECTED);
                infect = new vector<bool>(rows*cols, NOT_INFECTED);
               
                while (true) {

                    int blob_row;
                    int blob_col;

                    grid_file >> blob_row;
                    grid_file >> blob_col;

                    if (grid_file.eof()) {
                        break;
                    }

                    area->operator[](indexof(blob_row,blob_col)) = INFECTED;
                }

                grid_file.close();
            }

            // You may need to alter the destructor
            grid::~grid () {
                delete area;
                delete infect;
            }

            // You will need to alter this function to display the
            // plus signs (+) next to the cells that belong to
            // a counted colony.
            ostream &operator<<(ostream &stream, const grid& ob) {

                for (int row=0; row < ob.rows; row++) {
               
                    for (int col=0; col < ob.cols; col++) {

                        stream << ob.area->operator[](ob.indexof(row, col));
                        if( ob.infect->operator[] ( ob.indexof(row, col) ) )
                            stream << "+ ";
                        else
                            stream << "   ";
                    }

                    stream << endl;
                }

                stream << endl;
                return stream;
            }

            // Replace the return statement in this function with your
            // recursive implementation of this method */
            int grid::count (int row, int col) {

                if( row < 0 || col < 0 || row == rows || col == cols)
                    return 0;

                if( area->operator[](indexof(row,col) ) == NOT_INFECTED )
                    return 0;

                if(infect->operator[](indexof(row,col)) == INFECTED)
                    return 0;

                infect->operator[](indexof(row,col)) = INFECTED;

                // Recursive test the 8 point near the point
                // which area is INEFCTED and infect is NOT_INFECTED

                return    count( row - 1, col - 1 ) + count ( row - 1, col )
                    + count( row - 1, col + 1 ) + count( row, col - 1 )
                    + count( row, col ) + 1 + count( row, col + 1 )
                    + count( row + 1, col - 1 ) + count( row + 1, col )
                    + count( row + 1, col + 1 );
            }
            posted @ 2007-11-15 20:40 DraculaW 閱讀(489) | 評論 (0)編輯 收藏

                 摘要: 一道簡單的作業貼 呵呵   閱讀全文
            posted @ 2007-11-15 20:39 DraculaW 閱讀(448) | 評論 (0)編輯 收藏

            其實這個題目也很簡單 有很多種做法...

            就是給一個array你 然后你找出 i,j使從第i個加到第j個最大就好了啊

            最簡單的算法就是兩個for 算下來不到n^2的時間復雜度 可是還有更快的算法哦

            首先 可以使用分治算法 這樣的算法大概時間復雜度是 n*lg n, 但是這樣還不是最好的

            最好的其實是把前一個狀態儲存下來然后進行比較 這個算法時間復雜度只有n哦 很快的呢

            先不要看 給個 int a[10] = { 31, -41, 59, 26, -53, 58, 97, -93, -23, 84 }

            求它的最大子串有多大哦

            inline int
            max( int a, int b)
            {
                return a > b ? a : b;
            }

            /*****************************************************************************
            * This Function count a array find the largest string count max              *
            * Function : CountMax                                                        *
            * int    *a : the array of int                                                *
            * int     n : the range of array                                              *
            * return    : the sum of max this function find                               *
            *****************************************************************************/
            int
            CountMax ( int *a, int n )
            {
                int sum = 0, tmp = 0;
                for( int i = 0; i < n; i++ )
                {
                    tmp = max( 0, tmp + a[i] );
                    sum = max( sum, tmp );
                }

                return sum;
            }
            /* -----   end of function CountMax   ----- */
            posted @ 2007-11-15 20:37 DraculaW 閱讀(143) | 評論 (0)編輯 收藏

            僅列出標題
            共2頁: 1 2 
            精品国产乱码久久久久久1区2区| 国产成人精品久久| 久久狠狠爱亚洲综合影院| 久久精品成人欧美大片| 国产69精品久久久久777| 久久久久亚洲av成人无码电影| 婷婷国产天堂久久综合五月| 国产成人久久AV免费| 少妇久久久久久被弄到高潮| 久久66热人妻偷产精品9| 久久亚洲欧洲国产综合| 激情伊人五月天久久综合| 久久亚洲色一区二区三区| 欧美黑人激情性久久| 一本久久a久久精品综合香蕉 | 狠狠狠色丁香婷婷综合久久俺| 久久久久成人精品无码 | 国产99久久久国产精免费| 香蕉99久久国产综合精品宅男自| 久久不见久久见免费视频7| 久久精品中文字幕大胸| 久久www免费人成看国产片| 久久人人妻人人爽人人爽| 性做久久久久久久久老女人| 久久99国产精一区二区三区| 亚洲精品tv久久久久久久久 | 亚洲精品无码专区久久同性男| 精品久久一区二区| 久久精品九九亚洲精品天堂 | 日韩人妻无码精品久久免费一| 久久久久久久综合日本| 久久精品国产亚洲7777| 久久99热这里只有精品国产| 久久综合九色综合久99| 久久久中文字幕| 国产精品欧美亚洲韩国日本久久 | 日本精品一区二区久久久| 久久99精品久久久久久秒播| 久久久艹| 久久人人爽人人爽人人片AV麻烦| 亚洲精品无码久久久久AV麻豆|