锘??xml version="1.0" encoding="utf-8" standalone="yes"?>久久中文娱乐网,97超级碰碰碰碰久久久久 ,精品熟女少妇av免费久久http://m.shnenglu.com/dqchen/鍐欏嚭涓涓彲浠ュ伐浣滅殑紼嬪簭騫朵笉澶?/description>zh-cnSat, 28 Jun 2025 17:18:00 GMTSat, 28 Jun 2025 17:18:00 GMT60tatehttp://m.shnenglu.com/dqchen/archive/2008/09/18/62216.htmlDainDainThu, 18 Sep 2008 11:58:00 GMThttp://m.shnenglu.com/dqchen/archive/2008/09/18/62216.htmlhttp://m.shnenglu.com/dqchen/comments/62216.htmlhttp://m.shnenglu.com/dqchen/archive/2008/09/18/62216.html#Feedback0http://m.shnenglu.com/dqchen/comments/commentRss/62216.htmlhttp://m.shnenglu.com/dqchen/services/trackbacks/62216.html


Dain 2008-09-18 19:58 鍙戣〃璇勮
]]>Getting the Minimum and Maximum Values for a Numeric Typehttp://m.shnenglu.com/dqchen/archive/2007/05/29/25041.htmlDainDainTue, 29 May 2007 02:38:00 GMThttp://m.shnenglu.com/dqchen/archive/2007/05/29/25041.htmlhttp://m.shnenglu.com/dqchen/comments/25041.htmlhttp://m.shnenglu.com/dqchen/archive/2007/05/29/25041.html#Feedback2http://m.shnenglu.com/dqchen/comments/commentRss/25041.htmlhttp://m.shnenglu.com/dqchen/services/trackbacks/25041.htmlGetting numeric limits

#include <iostream>
#include <limits>

using namespace std;

template<typename T>
void showMinMax() {
   cout << "min: " << numeric_limits<T>::min() << endl;
   cout << "max: " << numeric_limits<T>::max() << endl;
   cout << endl;
}

int main() {
   cout << "short:" << endl;
   showMinMax<short>();
   cout << "int:" << endl;
   showMinMax<int>();
   cout << "long:" << endl;
   showMinMax<long>();
   cout << "long long:" << endl;
   showMinMax<long long>();
   cout << "float:" << endl;
   showMinMax<float>();
   cout << "double:" << endl;
   showMinMax<double>();
   cout << "long double:" << endl;
   showMinMax<long double>();
   cout << "unsigned short:" << endl;
   showMinMax<unsigned short>();
   cout << "unsigned int:" << endl;
   showMinMax<unsigned int>();
   cout << "unsigned long:" << endl;
   showMinMax<unsigned long>();
   cout << "unsigned long long:" << endl;
   showMinMax<unsigned long long>();
}


Dain 2007-05-29 10:38 鍙戣〃璇勮
]]>3017http://m.shnenglu.com/dqchen/archive/2007/05/25/24809.htmlDainDainFri, 25 May 2007 02:06:00 GMThttp://m.shnenglu.com/dqchen/archive/2007/05/25/24809.htmlhttp://m.shnenglu.com/dqchen/comments/24809.htmlhttp://m.shnenglu.com/dqchen/archive/2007/05/25/24809.html#Feedback0http://m.shnenglu.com/dqchen/comments/commentRss/24809.htmlhttp://m.shnenglu.com/dqchen/services/trackbacks/24809.html#include <stdio.h>
#include <stdlib.h>
#include <vector>

using namespace std;

struct Node {
    int i,j;
    int value;
};

long num[100000];
vector<Node> matrix;

int main() {
    long n;
    long long m;
    scanf("%ld %lld",&n,&m);

    long i,j;
    for(i = 0;i < n;++i) {
        scanf("%ld",&num[i]);
    }

    for(i = 0;i < n;++i) {
        if(num[i] > m) {
            break;
        }
    }

    if(i < n) {
        printf("-1\n");

        return 0;
    }

    long long res = -1;
    long long sum;
    long max,min = 0;
    for(i = 0;i < n;++i) {
        if(i > 0) {
            min = 1000000;
            for(j = 0;j < matrix.size();++j) {
                if(matrix[j].j == i - 1 && matrix[j].value < min) {
                    min = matrix[j].value;
                }
            }
        }
        else {
            min = 0;
        }

        sum = 0;
        Node node;
        max = -1;
        for(j = i;j < n;++j) {
            sum += num[j];
            if(sum <= m) {
                if(max < num[j]) {                    
                    max = num[j];
                }
                node.i = i;
                node.j = j;
                node.value = max + min;
                matrix.push_back(node);
                if(j == n - 1) {
                    if(res != -1) {
                        if(node.value < res) {
                            res = node.value;
                        }
                    }
                    else {
                        res = node.value;
                    }
                }
            }
            else {
                break;
            }
        }
    }
    
    printf("%lld\n",res);

    return 0;
}

Dain 2007-05-25 10:06 鍙戣〃璇勮
]]>3017http://m.shnenglu.com/dqchen/archive/2007/05/25/24808.htmlDainDainFri, 25 May 2007 02:06:00 GMThttp://m.shnenglu.com/dqchen/archive/2007/05/25/24808.htmlhttp://m.shnenglu.com/dqchen/comments/24808.htmlhttp://m.shnenglu.com/dqchen/archive/2007/05/25/24808.html#Feedback0http://m.shnenglu.com/dqchen/comments/commentRss/24808.htmlhttp://m.shnenglu.com/dqchen/services/trackbacks/24808.html#include <stdio.h>
#include <stdlib.h>
#include <vector>

using namespace std;

struct Node {
    int i,j;
    int value;
};

long num[100000];
vector<Node> matrix;

int main() {
    long n;
    long long m;
    scanf("%ld %lld",&n,&m);

    long i,j;
    for(i = 0;i < n;++i) {
        scanf("%ld",&num[i]);
    }

    for(i = 0;i < n;++i) {
        if(num[i] > m) {
            break;
        }
    }

    if(i < n) {
        printf("-1\n");

        return 0;
    }

    long long res = -1;
    long long sum;
    long max,min = 0;
    for(i = 0;i < n;++i) {
        if(i > 0) {
            min = 1000000;
            for(j = 0;j < matrix.size();++j) {
                if(matrix[j].j == i - 1 && matrix[j].value < min) {
                    min = matrix[j].value;
                }
            }
        }
        else {
            min = 0;
        }

        sum = 0;
        Node node;
        max = -1;
        for(j = i;j < n;++j) {
            sum += num[j];
            if(sum <= m) {
                if(max < num[j]) {                    
                    max = num[j];
                }
                node.i = i;
                node.j = j;
                node.value = max + min;
                matrix.push_back(node);
                if(j == n - 1) {
                    if(res != -1) {
                        if(node.value < res) {
                            res = node.value;
                        }
                    }
                    else {
                        res = node.value;
                    }
                }
            }
            else {
                break;
            }
        }
    }
    
    printf("%lld\n",res);

    return 0;
}

Dain 2007-05-25 10:06 鍙戣〃璇勮
]]>涓嶈鍐嶇姱浣庣駭鐨勯敊璇?/title><link>http://m.shnenglu.com/dqchen/archive/2007/05/24/24753.html</link><dc:creator>Dain</dc:creator><author>Dain</author><pubDate>Thu, 24 May 2007 05:56:00 GMT</pubDate><guid>http://m.shnenglu.com/dqchen/archive/2007/05/24/24753.html</guid><wfw:comment>http://m.shnenglu.com/dqchen/comments/24753.html</wfw:comment><comments>http://m.shnenglu.com/dqchen/archive/2007/05/24/24753.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://m.shnenglu.com/dqchen/comments/commentRss/24753.html</wfw:commentRss><trackback:ping>http://m.shnenglu.com/dqchen/services/trackbacks/24753.html</trackback:ping><description><![CDATA[<span style="FONT-SIZE: 10pt">鏈榪戯紝鎬繪槸鐘潪甯鎬綆綰х殑閿欒<br>鐪嬮?shù)笉浠斁l?br>灝唈璇啓鎴恔錛岃屼笖鎬殑鏄紝嫻嬭瘯鐨勪緥瀛愰兘閫氳繃浜?jiǎn)锛屽悗鏉ラ氳繃debug鎵嶆壘鍒頒簡(jiǎn)榪欎釜寰堜綆綰х殑閿欒<br><br>鐪熸槸姘斾漢鍟?br><br>涓嶈鍐嶇姱浜?/span> <img src ="http://m.shnenglu.com/dqchen/aggbug/24753.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://m.shnenglu.com/dqchen/" target="_blank">Dain</a> 2007-05-24 13:56 <a href="http://m.shnenglu.com/dqchen/archive/2007/05/24/24753.html#Feedback" target="_blank" style="text-decoration:none;">鍙戣〃璇勮</a></div>]]></description></item><item><title>鍒楀嚭鎵鏈?浣嶆暟錛屽畠鐨勫墠n浣嶈兘琚玭鏁撮櫎http://m.shnenglu.com/dqchen/archive/2007/04/16/22030.htmlDainDainMon, 16 Apr 2007 09:29:00 GMThttp://m.shnenglu.com/dqchen/archive/2007/04/16/22030.htmlhttp://m.shnenglu.com/dqchen/comments/22030.htmlhttp://m.shnenglu.com/dqchen/archive/2007/04/16/22030.html#Feedback5http://m.shnenglu.com/dqchen/comments/commentRss/22030.htmlhttp://m.shnenglu.com/dqchen/services/trackbacks/22030.html鏈綆鍗曠殑鏄┓涓撅紝涓嶈繃閭ｅ彲瑕丱(9*109)錛屼笉鍙彇 

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

vector<int> fun(int n)
{
    vector<int> last,all;
    int i,j,k;
    for(i = 1;i < 10;++i)
        all.push_back(i);

    if(n == 1)
        return all;

    int size;
    int num;
    for(i = 2;i <= n;++i)
    {
        last = all;
        all.clear();
        size = (int)last.size();
        for(j = 0;j < size;++j)
        {
            for(k = 0;k < 10;++k)
            {
                num = last[j] * 10 + k;
                if(num % i == 0)
                    all.push_back(num);
            }
        }
        last.clear();
    }

    return all;
}

Dain 2007-04-16 17:29 鍙戣〃璇勮
]]>鏈澶х殑瀛愬簭鍒楀拰闂http://m.shnenglu.com/dqchen/archive/2007/02/07/18500.htmlDainDainWed, 07 Feb 2007 02:52:00 GMThttp://m.shnenglu.com/dqchen/archive/2007/02/07/18500.htmlhttp://m.shnenglu.com/dqchen/comments/18500.htmlhttp://m.shnenglu.com/dqchen/archive/2007/02/07/18500.html#Feedback7http://m.shnenglu.com/dqchen/comments/commentRss/18500.htmlhttp://m.shnenglu.com/dqchen/services/trackbacks/18500.html姹傝В璇ラ棶棰樼殑鍥涚綆楁硶錛?br /> 鏃墮棿O(N3)錛?/em>綆楁硶涓
int 聽(tīng)MaxSubsequenceSum( const 聽(tīng) int 聽(tīng)A[], int 聽(tīng)N)
 {
聽(tīng)聽(tīng)聽(tīng)聽(tīng) int 聽(tīng)ThisSum,MaxSum,i,j,k;
聽(tīng)聽(tīng)聽(tīng)聽(tīng)
聽(tīng)聽(tīng)聽(tīng)聽(tīng)MaxSum聽(tīng) = 聽(tīng) 0 ;
聽(tīng)聽(tīng)聽(tīng)聽(tīng) for (i聽(tīng) = 聽(tīng) 0 ;i聽(tīng) < 聽(tīng)N;i ++ )
聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng) for (j聽(tīng) = 聽(tīng)i;j聽(tīng) < 聽(tīng)N;j ++ )
聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng) {
聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)ThisSum聽(tīng) = 聽(tīng) 0 ;
聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng) for (k聽(tīng) = 聽(tīng)i;k聽(tīng) <= 聽(tīng)j;k ++ )聽(tīng)聽(tīng)聽(tīng)聽(tīng)ThisSum聽(tīng) += 聽(tīng)A[k];聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)
聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng) if (ThisSum聽(tīng) > 聽(tīng)MaxSum)聽(tīng)聽(tīng)聽(tīng)聽(tīng)MaxSum聽(tīng) = 聽(tīng)ThisSum;
聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)}
聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)
聽(tīng)聽(tīng)聽(tīng)聽(tīng) return 聽(tīng)MaxSum;
}
鏃墮棿O(N2)錛?/em>綆楁硶浜?/strong>
int 聽(tīng)MaxSubsequenceSum( const 聽(tīng) int 聽(tīng)A[], int 聽(tīng)N)
 {
聽(tīng)聽(tīng)聽(tīng)聽(tīng) int 聽(tīng)ThisSum,MaxSum,i,j;
聽(tīng)聽(tīng)聽(tīng)聽(tīng)
聽(tīng)聽(tīng)聽(tīng)聽(tīng)MaxSum聽(tīng) = 聽(tīng) 0 ;
聽(tīng)聽(tīng)聽(tīng)聽(tīng) for (i聽(tīng) = 聽(tīng) 0 ;i聽(tīng) < 聽(tīng)N;i ++ )
聽(tīng)聽(tīng)聽(tīng)聽(tīng) {
聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)ThisSum聽(tīng) = 聽(tīng) 0 ;
聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng) for (j聽(tīng) = 聽(tīng)i;j聽(tīng) < 聽(tīng)N;j ++ )
聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng) {
聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)ThisSum聽(tīng) += 聽(tīng)A[k];聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)
聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng) if (ThisSum聽(tīng) > 聽(tīng)MaxSum)聽(tīng)聽(tīng)聽(tīng)聽(tīng)MaxSum聽(tīng) = 聽(tīng)ThisSum;
聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)}
聽(tīng)聽(tīng)聽(tīng)聽(tīng)}
聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)
聽(tīng)聽(tīng)聽(tīng)聽(tīng) return 聽(tīng)MaxSum;
}
鏃墮棿O(NlogN)錛岀畻娉曚笁
static 聽(tīng) int 聽(tīng)MaxSubSum( const 聽(tīng) int 聽(tīng)A[], int 聽(tīng)Left, int 聽(tīng)Right)
 {
聽(tīng)聽(tīng)聽(tīng)聽(tīng) int 聽(tīng)MaxLeftSum,MaxRightSum;
聽(tīng)聽(tīng)聽(tīng)聽(tīng) int 聽(tīng)MaxLeftBorderSum,MaxRightBorderSum;
聽(tīng)聽(tīng)聽(tīng)聽(tīng) int 聽(tīng)LeftBorderSum,RightBorderSum;
聽(tīng)聽(tīng)聽(tīng)聽(tīng) int 聽(tīng)Center,i;
聽(tīng)聽(tīng)聽(tīng)聽(tīng)
聽(tīng)聽(tīng)聽(tīng)聽(tīng) if (Left聽(tīng) == 聽(tīng)Right)
聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng) if (A[left]聽(tīng) > 聽(tīng) 0 )聽(tīng)聽(tīng)聽(tīng)聽(tīng) return 聽(tīng)A[left];
聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng) else 聽(tīng)聽(tīng)聽(tīng)聽(tīng) return 聽(tīng) 0 ;
聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)
聽(tīng)聽(tīng)聽(tīng)聽(tīng)Center聽(tīng) = 聽(tīng)(Left聽(tīng) + 聽(tīng)Right)聽(tīng) / 聽(tīng) 2 ;
聽(tīng)聽(tīng)聽(tīng)聽(tīng)MaxLeftSum聽(tīng) = 聽(tīng)MaxSubSum(A,Left,Center);
聽(tīng)聽(tīng)聽(tīng)聽(tīng)MaxRightSum聽(tīng) = 聽(tīng)MaxSubSum(A,Center聽(tīng) + 聽(tīng) 1 ,Right);
聽(tīng)聽(tīng)聽(tīng)聽(tīng)
聽(tīng)聽(tīng)聽(tīng)聽(tīng)MaxLeftBorderSum聽(tīng) = 聽(tīng) 0 ;
聽(tīng)聽(tīng)聽(tīng)聽(tīng)LeftBorderSum聽(tīng) = 聽(tīng) 0 ;
聽(tīng)聽(tīng)聽(tīng)聽(tīng) for (i聽(tīng) = 聽(tīng)Center;i聽(tīng) >= 聽(tīng)Left;i -- )
聽(tīng)聽(tīng)聽(tīng)聽(tīng) {
聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)LeftBorderSum聽(tīng) += 聽(tīng)A[i];
聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng) if (LeftBorderSum聽(tīng) > 聽(tīng)MaxLeftBorderSum)聽(tīng)聽(tīng)聽(tīng)聽(tīng)MaxLeftBorderSum聽(tīng) = 聽(tīng)LeftBorderSum;
聽(tīng)聽(tīng)聽(tīng)聽(tīng)}
聽(tīng)聽(tīng)聽(tīng)聽(tīng)
聽(tīng)聽(tīng)聽(tīng)聽(tīng)MaxRightBorderSum聽(tīng) = 聽(tīng) 0 ;
聽(tīng)聽(tīng)聽(tīng)聽(tīng)RightBorderSum聽(tīng) = 聽(tīng) 0 ;
聽(tīng)聽(tīng)聽(tīng)聽(tīng) for (i聽(tīng) = 聽(tīng)Center聽(tīng) + 聽(tīng) 1 ;i聽(tīng) <= 聽(tīng)Right;i ++ )
聽(tīng)聽(tīng)聽(tīng)聽(tīng) {
聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)RightBorderSum聽(tīng) += 聽(tīng)A[i];
聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng) if (RightBorderSum聽(tīng) > 聽(tīng)MaxRightBorderSum)聽(tīng)聽(tīng)聽(tīng)聽(tīng)MaxRightBorderSum聽(tīng) = 聽(tīng)RightBorderSum;
聽(tīng)聽(tīng)聽(tīng)聽(tīng)}
聽(tīng)聽(tīng)聽(tīng)聽(tīng)
聽(tīng)聽(tīng)聽(tīng)聽(tīng) return 聽(tīng)Max3(MaxLeftSum,MaxRightSum,MaxLeftBorderSum聽(tīng) + 聽(tīng)MaxRightBorderSum);
}

int 聽(tīng)MaxSubsequenceSum( const int聽(tīng)聽(tīng)A[],int 聽(tīng)N)
 {
聽(tīng)聽(tīng)聽(tīng)聽(tīng) return 聽(tīng)MaxSubSum(A, 0 ,N聽(tīng) - 聽(tīng) 1 );聽(tīng)聽(tīng)聽(tīng)聽(tīng)
}
鏃墮棿O(N)錛岀畻娉曞洓
intMaxSubsequenceSum( const int 聽(tīng)A[], int 聽(tīng)N)
 {
聽(tīng)聽(tīng)聽(tīng)聽(tīng) int 聽(tīng)ThisSum,MaxSum,i;
聽(tīng)聽(tīng)聽(tīng)聽(tīng)
聽(tīng)聽(tīng)聽(tīng)聽(tīng)ThisSum聽(tīng) = 聽(tīng)MaxSum聽(tīng) = 聽(tīng) 0 ;
聽(tīng)聽(tīng)聽(tīng)聽(tīng) for (i聽(tīng) = 聽(tīng) 0 ;i聽(tīng) < 聽(tīng)N;i ++ )
聽(tīng)聽(tīng)聽(tīng)聽(tīng) {
聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)ThisSum聽(tīng) += 聽(tīng)A[i];
聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng) if (ThisSum聽(tīng) > 聽(tīng)MaxSum)
聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)MaxSum聽(tīng) = 聽(tīng)ThisSum;
聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng) else
聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)聽(tīng)ThisSum聽(tīng) = 聽(tīng) 0 ;
聽(tīng)聽(tīng)聽(tīng)聽(tīng)}
聽(tīng)聽(tīng)聽(tīng)聽(tīng)
聽(tīng)聽(tīng)聽(tīng)聽(tīng) return 聽(tīng)MaxSum;
}


鍙傝冦婃暟鎹粨鏋勪笌綆楁硶鍒嗘瀽銆?/font>



Dain 2007-02-07 10:52 鍙戣〃璇勮
]]>緙栧啓閫掑綊鍥涙潯鍩烘湰娉曞垯http://m.shnenglu.com/dqchen/archive/2007/01/31/18234.htmlDainDainWed, 31 Jan 2007 13:03:00 GMThttp://m.shnenglu.com/dqchen/archive/2007/01/31/18234.htmlhttp://m.shnenglu.com/dqchen/comments/18234.htmlhttp://m.shnenglu.com/dqchen/archive/2007/01/31/18234.html#Feedback0http://m.shnenglu.com/dqchen/comments/commentRss/18234.htmlhttp://m.shnenglu.com/dqchen/services/trackbacks/18234.html
  • 鍩哄噯鎯呭艦銆傚繀欏昏鏈夋煇浜涘熀鍑嗘儏褰紝瀹冩棤欏婚掑綊灝辮兘瑙ｅ嚭錛屼篃灝辨槸瑕佹湁閫鍑洪掑綊鐨勬潯浠躲?/font>
  • 涓嶆柇鎺ㄨ繘銆傚浜庨偅浜涢渶瑕侀掑綊姹傝В鐨勬儏褰紝姣忎竴嬈￠掑綊璋冪敤閮藉繀欏昏浣挎眰瑙ｇ姸鍐墊湞鎺ヨ繎鍩哄噯鎯呭艦鐨勬柟鍚戞帹榪涖?/font>
  • 璁捐娉曞垯銆傚亣璁炬墍鏈夌殑閫掑綊璋冪敤閮借兘榪愯銆?/font>
  • 鍚堟垚鏁堢泭銆傛眰瑙ｄ竴涓棶棰樼殑鍚屼竴涓疄渚嬫椂錛屽垏鍕垮湪涓嶅悓鐨勯掑綊璋冪敤涓仛閲嶅鎬х殑宸ヤ綔銆?/font>


    • Dain 2007-01-31 21:03 鍙戣〃璇勮
    ]]>    璇諱功璁″垝http://m.shnenglu.com/dqchen/archive/2007/01/31/18230.htmlDainDainWed, 31 Jan 2007 12:07:00 GMThttp://m.shnenglu.com/dqchen/archive/2007/01/31/18230.htmlhttp://m.shnenglu.com/dqchen/comments/18230.htmlhttp://m.shnenglu.com/dqchen/archive/2007/01/31/18230.html#Feedback1http://m.shnenglu.com/dqchen/comments/commentRss/18230.htmlhttp://m.shnenglu.com/dqchen/services/trackbacks/18230.html閬囧埌浜?jiǎn)濂藉涓嶈兘瑙ｅ喅鐨勯棶棰樺悗锛岃寰楀簲璇ラ噸鏂拌璇讳功浜?jiǎn)
    鏈榪戜拱浜?jiǎn)鍑犳湰涔?br />
    銆奙ore聽(tīng)Effective聽(tīng)CPP銆?br />銆奅ffective聽(tīng)STL銆?br />銆婂茍琛岀▼搴忚璁°?br />銆婃暟鎹粨鏋勪笌綆楁硶鍒嗘瀽鈥斺擟璇█鎻忚堪銆?/font>聽(tīng)


    Dain 2007-01-31 20:07 鍙戣〃璇勮
    ]]>    寮曠敤鍜屾寚閽堝弬鏁扮殑鍏崇郴http://m.shnenglu.com/dqchen/archive/2007/01/19/17773.htmlDainDainFri, 19 Jan 2007 01:56:00 GMThttp://m.shnenglu.com/dqchen/archive/2007/01/19/17773.htmlhttp://m.shnenglu.com/dqchen/comments/17773.htmlhttp://m.shnenglu.com/dqchen/archive/2007/01/19/17773.html#Feedback1http://m.shnenglu.com/dqchen/comments/commentRss/17773.htmlhttp://m.shnenglu.com/dqchen/services/trackbacks/17773.html涓ょ鍙傛暟閮藉厑璁稿嚱鏁頒慨鏀瑰疄鍙傛寚鍚戠殑瀵硅薄錛岄兘鍏佽鏈夋晥鍦板悜鍑芥暟浼犻掑ぇ綾誨瀷瀵硅薄銆傛墍浠ユ庝箞鏍峰喅瀹氭妸鍑芥暟鍙傛暟澹版槑鎴愬紩鐢ㄨ繕鏄寚閽堝憿錛?br />寮曠敤蹇呴』琚垵濮嬪寲涓烘寚鍚戜竴涓璞★紝涓鏃﹀垵濮嬪寲浜?jiǎn)锛屽畠灏变笉鑳藉啀鎸囧悜鍏朵粬瀵硅薄銆傛寚閽堝彲浠ユ寚鍚戜竴緋誨垪涓嶅悓鐨勫璞′篃鍙互浠涔堥兘涓嶆寚鍚戙?br />鍥犱負(fù)鎸囬拡鍙兘鎸囧悜涓涓璞℃垨娌℃湁浠諱綍瀵硅薄錛屾墍浠ュ嚱鏁板湪紜畾鎸囬拡瀹為檯鎸囧悜涓涓湁鏁堢殑瀵硅薄涔嬪墠涓嶈兘瀹夊叏瑙ｅ紩鐢ㄤ竴涓寚閽堛傚錛?br />
    class 聽(tīng)X;
     void 聽(tīng)fun(X聽(tīng) * x)
     {
    聽(tīng)聽(tīng)     // 聽(tīng)鍦ㄨВ寮曠敤鎸囬拡涔嬪墠紜俊瀹冮潪0
    聽(tīng)聽(tīng) if (x聽(tīng) != 聽(tīng) 0 )
    聽(tīng)聽(tīng)聽(tīng)聽(tīng)     // 聽(tīng)瑙ｅ紩鐢ㄦ寚閽?/span>
    }     聽(tīng)聽(tīng)
    鑰岋紝瀵逛簬寮曠敤鍙傛暟錛屽嚱鏁頒笉闇瑕佷繚璇佸畠鎸囧悜涓涓璞°傚紩鐢ㄥ繀欏繪寚鍚戜竴涓璞★紝涓嶅笇鏈涘悜鎸囬拡閭ｆ牱榪涜瑙ｅ紩鐢ㄣ傚錛?br />
    class聽(tīng)Type;
    void聽(tīng)op(const聽(tīng)Type聽(tīng)&t1,const聽(tīng)Type聽(tīng)&t2);

    int聽(tīng)main()
    {
    聽(tīng)聽(tīng)Type聽(tīng)obj1;
    聽(tīng)聽(tīng)    //聽(tīng)璁劇疆obj1涓烘煇涓?br />
    聽(tīng)聽(tīng)    //聽(tīng)閿欒錛氬紩鐢ㄥ弬鏁扮殑瀹炲弬涓嶈兘涓?
    聽(tīng)聽(tīng)op(obj1,0);

    聽(tīng)聽(tīng)    //聽(tīng)
    聽(tīng)聽(tīng)return聽(tīng)0;
    }
    濡傛灉涓涓弬鏁板彲鑳藉湪鍑芥暟涓寚鍚戜笉鍚岀殑瀵硅薄錛屾垨鑰呰繖涓弬鏁板彲鑳戒笉鎸囧悜浠諱綍瀵硅薄錛屽垯蹇呴』浣跨敤鎸囬拡鍙傛暟銆?br />寮曠敤鍙傛暟鐨勪竴涓噸瑕佺敤娉曪紝瀹冨厑璁告湁鏁堝湴瀹炵幇閲嶈澆鎿嶄綔絎︾殑鍚屾椂錛岃繕鑳戒繚璇佺敤娉曠殑鐩磋鎬с傚彲浠ュ弬鑰冦奀++ Primer銆?br />
    ps 鍙戠幇涔?87欏電殑絎簩涓▼搴忎緥瀛愭槸閿欑殑

    Dain 2007-01-19 09:56 鍙戣〃璇勮
    ]]>     久久久久久久精品妇女99| 久久久久久综合一区中文字幕| 久久国产成人亚洲精品影院| 日韩欧美亚洲综合久久影院d3| 国产精品免费久久久久电影网| 亚洲国产香蕉人人爽成AV片久久 | 热99re久久国超精品首页| 久久精品免费网站网| 亚洲AV无码久久精品成人| 久久成人精品视频| 亚洲色欲久久久久综合网| 久久国产精品久久国产精品| 久久亚洲中文字幕精品一区四| 久久久久99精品成人片直播| 欧美一级久久久久久久大片| 2022年国产精品久久久久| 欧美精品九九99久久在观看| 69SEX久久精品国产麻豆| 亚洲精品乱码久久久久久不卡| 久久久久久国产精品免费无码 | 人妻无码精品久久亚瑟影视| 日韩久久久久久中文人妻| 久久精品国产亚洲一区二区三区| 久久亚洲中文字幕精品有坂深雪 | 日本欧美国产精品第一页久久| 久久亚洲春色中文字幕久久久| 思思久久好好热精品国产| segui久久国产精品| 久久久久久狠狠丁香| 久久精品国产亚洲77777| 亚洲AV无码久久精品蜜桃| 伊人久久大香线蕉综合热线| 久久99精品国产麻豆蜜芽| 久久99热狠狠色精品一区| 国产精品无码久久久久久| 久久国产高潮流白浆免费观看| 久久99精品久久久大学生| 日韩人妻无码一区二区三区久久99| 精品久久久无码中文字幕天天| 2022年国产精品久久久久| 久久99精品国产|