青青草原综合久久大伊人导航_色综合久久天天综合_日日噜噜夜夜狠狠久久丁香五月_热久久这里只有精品

The Fourth Dimension Space

枯葉北風寒，忽然年以殘，念往昔，語默心酸。二十光陰無一物，韶光賤，寐難安； 不畏形影單，道途阻且慢，哪曲折，如渡飛湍。斬浪劈波酬壯志，同把酒，共言歡！ -如夢令

數學建模之——商人過河問題 算法核心:搜索法

問題描述： 三個商人各帶一個隨從乘船過河，一只小船只能容納2人，由他們自己劃船。三個商人竊聽到隨從們密謀，在河的任意一岸上，只要隨從的人數比商人多，就殺掉商人。但是如何乘船渡河的決策權在商人手中，商人們如何安排渡河計劃確保自身安全？

數學建模課上，老師給我們出了這樣一個問題，要我們編程解決，呵呵，于是，就寫了下面這個程序，這個程序適用于商人數和隨從數都《=1000的情況，并且約定小船的容量為2，此程序可以輸出每一步的決策過程，還外包了界面以滿足上課演示的需要；不過限于老師的要求，就沒有寫成小船容量為任意值的情況，如果有時間的話我會繼續往下寫的（貌似也比較容易的樣子）~
如果程序中有BUG，歡迎反饋給我,QQ:64076241.

//本程序在商人數<=1000,隨從數<=1000時測試通過，其余數據不能保證其正確性.
#include<iostream>
#include <windows.h>
#include <math.h>
#include <stdio.h>
#include <algorithm>
#include<time.h>
#include<conio.h>
using namespace std;



#define NMAX 1001


struct node
{

    int x;
    int y;
}line[10000001];

struct node2
{
    int data1;
    int data2;
    int prex1;
    int prey1;
    int prex2;
    int prey2;
};

node2 a[NMAX][NMAX];

int main ()
{

    
        int N=15;
        while(N--)
        {
            system("cls");
            cout<<endl<<endl<<endl<<endl<<endl<<endl;
            cout<<"     ☆★☆★☆★☆★☆★☆★☆★☆★☆★☆★☆★☆★☆★☆★☆★☆★☆★☆"<<endl;
            cout<<"     ★                                                                  ★"<<endl;
            cout<<"     ☆                                                                  ☆"<<endl;
            cout<<"     ★                   歡迎來到商人過河模型演示程序                   ★"<<endl;
            cout<<"     ☆                                                                  ☆"<<endl;    
            cout<<"     ★                       制    作：羅偉濤（abilitytao）             ★"<<endl;
            cout<<"     ☆                       指導老師：許春根（南京理工大學應用數學系） ☆"<<endl;
            cout<<"     ★                                                                  ★"<<endl;
            cout<<"     ☆★☆★☆★☆★☆★☆★☆★☆★☆★☆★☆★☆★☆★☆★☆★☆★☆★☆"<<endl;
            Sleep(100);
            system("cls");
            cout<<endl<<endl<<endl<<endl<<endl<<endl;
            cout<<"     ★☆★☆★☆★☆★☆★☆★☆★☆★☆★☆★☆★☆★☆★☆★☆★☆★☆★"<<endl;
            cout<<"     ☆                                                                  ☆"<<endl;
            cout<<"     ★                                                                  ★"<<endl;
            cout<<"     ☆                   歡迎來到商人過河模型演示程序                   ☆"<<endl;
            cout<<"     ★                                                                  ★"<<endl;
            cout<<"     ☆                       制    作：羅偉濤（abilitytao）             ☆"<<endl;
            cout<<"     ★                       指導老師：許春根（南京理工大學應用數學系） ★"<<endl;
            cout<<"     ☆                                                                  ☆"<<endl;
            cout<<"     ★☆★☆★☆★☆★☆★☆★☆★☆★☆★☆★☆★☆★☆★☆★☆★☆★☆★"<<endl;
            Sleep(100);
        }
        cout<<"\n\n\n\n                                                   請按任意鍵進入演示程序"<<endl;
        char any;
        getch();

    ///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
    int n;
    int m;
    int i,j;
    int flagnum1;
    int flagnum2;
    while(1)
    {    
        printf("請輸入商人數：");
        scanf("%d",&n);
        printf("請輸入隨從數：");
        scanf("%d",&m);


        if(n>1000)
        {
            printf("本程序僅在1000以內保證其正確性，請重新輸入\n");
            continue;
        }


    


        for(i=0;i<=n;i++)
        {

            for(j=0;j<=m;j++)
            {
                if(i==0||i==n)
                {
                    a[i][j].data1=1;
                    a[i][j].data2=1;
                    continue;
                }
                if(i>=j&&n-i>=m-j)
                {
                    a[i][j].data1=1;
                    a[i][j].data2=1;
                }
                    
            }
        }
        ////////////////////////////////////////////////////////////////////以上為初始化////////////////////////////////////////////////////////////////////////////////
        int flag;
        int front=1;
        int rear=1;
        line[rear].x=n;
        line[rear].y=m;
        flag=1;
        flagnum1=1;
        flagnum2=0;
        while(front<=rear)
        {
            if(line[front].x==0&&line[front].y==0)
                break;
            if(flag==1)
            {
                if(a[line[front].x][line[front].y].data1!=1)
                {
                    flagnum1--;
                    if(flagnum1==0)
                        flag=2;
                    front++;
                    continue;
                }
                
                a[line[front].x][line[front].y].data1=0;
                flagnum1--;
                if(flagnum1==0)
                    flag=2;
                if(line[front].x-1>=0&&a[line[front].x-1][line[front].y].data2==1)
                {
                    rear++;
                    line[rear].x=line[front].x-1;
                    line[rear].y=line[front].y;
                    a[line[rear].x][line[rear].y].prex2=line[front].x;
                    a[line[rear].x][line[rear].y].prey2=line[front].y;
                    flagnum2++;
                }
                if(line[front].y-1>=0&&a[line[front].x][line[front].y-1].data2==1)
                {
                    rear++;
                    line[rear].x=line[front].x;
                    line[rear].y=line[front].y-1;
                    a[line[rear].x][line[rear].y].prex2=line[front].x;
                    a[line[rear].x][line[rear].y].prey2=line[front].y;
                    flagnum2++;
                }
                if(line[front].x-1>=0&&line[front].y-1>=0&&a[line[front].x-1][line[front].y-1].data2==1)
                {
                    rear++;
                    line[rear].x=line[front].x-1;
                    line[rear].y=line[front].y-1;
                    a[line[rear].x][line[rear].y].prex2=line[front].x;
                    a[line[rear].x][line[rear].y].prey2=line[front].y;
                    flagnum2++;
                }
                if(line[front].x-2>=0&&a[line[front].x-2][line[front].y].data2==1)
                {
                    rear++;
                    line[rear].x=line[front].x-2;
                    line[rear].y=line[front].y;
                    a[line[rear].x][line[rear].y].prex2=line[front].x;
                    a[line[rear].x][line[rear].y].prey2=line[front].y;
                    flagnum2++;

                }
                if(line[front].y-2>=0&&a[line[front].x][line[front].y-2].data2==1)
                {
                    rear++;
                    line[rear].x=line[front].x;
                    line[rear].y=line[front].y-2;
                    a[line[rear].x][line[rear].y].prex2=line[front].x;
                    a[line[rear].x][line[rear].y].prey2=line[front].y;
                    flagnum2++;
                }
                front++;
                continue;
            }
            else if(flag==2)
            {
                if(a[line[front].x][line[front].y].data2!=1)
                {
                    flagnum2--;
                    if(flagnum2==0)
                        flag=1;
                    front++;
                    continue;
                    
                }
                if(line[front].x==0&&line[front].y==0)
                    break;
                a[line[front].x][line[front].y].data2=0;
                flagnum2--;
                if(flagnum2==0)
                    flag=1;
                if(line[front].x+1<=n&&a[line[front].x+1][line[front].y].data1==1)
                {

                
                rear++;
                line[rear].x=line[front].x+1;
                line[rear].y=line[front].y;
                a[line[rear].x][line[rear].y].prex1=line[front].x;
                a[line[rear].x][line[rear].y].prey1=line[front].y;
                flagnum1++;
                }
                if (line[front].y+1<=m&&a[line[front].x][line[front].y+1].data1==1)
                {
                
                    rear++;
                    line[rear].x=line[front].x;
                    line[rear].y=line[front].y+1;
                    a[line[rear].x][line[rear].y].prex1=line[front].x;
                    a[line[rear].x][line[rear].y].prey1=line[front].y;
                    flagnum1++;
                }
                if(line[front].x+1<=n&&line[front].y+1<=m&&a[line[front].x+1][line[front].y+1].data1==1)
                {
                    rear++;
                    line[rear].x=line[front].x+1;
                    line[rear].y=line[front].y+1;
                    a[line[rear].x][line[rear].y].prex1=line[front].x;
                    a[line[rear].x][line[rear].y].prey1=line[front].y;
                    flagnum1++;
                }
                if(line[front].x+2<=n&&a[line[front].x+2][line[front].y].data1==1)
                {
                    rear++;
                    line[rear].x=line[front].x+2;
                    line[rear].y=line[front].y;
                    a[line[rear].x][line[rear].y].prex1=line[front].x;
                    a[line[rear].x][line[rear].y].prey1=line[front].y;
                    flagnum1++;
                }
                if(line[front].y+2<=m&&a[line[front].x][line[front].y+2].data1==1)
                {

                
                rear++;
                line[rear].x=line[front].x;
                line[rear].y=line[front].y+2;
                a[line[rear].x][line[rear].y].prex1=line[front].x;
                a[line[rear].x][line[rear].y].prey1=line[front].y;
                flagnum1++;
                
                }
                front++;
                continue;
            }
            front++;
        }
        if(front>rear)
        {
            cout<<"沒有可行的方案"<<endl;
            int choice;
            printf("如果您要繼續測試，請輸入1，退出請輸入2:");
            scanf("%d",&choice);
            if(choice==1)
                continue;
            else
                break;
        }
        int tempx=0;
        int tempy=0;
        int markx=0;
        int marky=0;
        printf("初始狀態下，河南岸有%d個商人，%d個隨從\n",n,m);
        //Sleep(5000);

        int flagforreturn=1;
        int step=1;

        while(1)
        {
            
            if (flagforreturn==1)
            {
                if(markx==n&&marky==m)
                    break;
                flagforreturn=2;
                tempx=a[markx][marky].prex2;
                tempy=a[markx][marky].prey2;
                printf("第%d步：河南岸有%d個商人，%d個隨從，此時，對岸有%d個商人，%d個隨從（此時船在北岸）\n\n",step,n-tempx,m-tempy,tempx,tempy);
                ///////////////////////////////////////////////////////////////////////////////////正確性檢測/////////////////////////////////////////////////////////////////////////////////////
            /*    if(tempx==0||tempx==n||(tempx>=tempy&&n-tempx>=m-tempy)&&(n-markx+m-marky>n-tempx+m-tempy))
                    cout<<"此步正確"<<endl;
                else
                    cout<<"此步錯誤"<<endl;*///
                ////////////////////////////////////////////////////////////////////////////////////////正確性檢測/////////////////////////////////////////////////////////////////////////////////////
                markx=tempx;
                marky=tempy;
                step++;
                //Sleep(5000);
            }
            else if(flagforreturn==2)
            {
                if(markx==n&&marky==m)
                    break;
                flagforreturn=1;
                tempx=a[markx][marky].prex1;
                tempy=a[markx][marky].prey1;

                printf("第%d步：河南岸有%d個商人,%d個隨從，此時，對岸有%d個商人，%d個隨從（此時船在南岸）\n\n",step,n-tempx,m-tempy,tempx,tempy);

                ////////////////////////////////////////////////////////////////////////////////////////正確性檢測/////////////////////////////////////////////////////////////////////////////////////
                /*    if(tempx==0||tempx==n||(tempx>=tempy&&n-tempx>=m-tempy)&&(n-markx+m-marky<n-tempx+m-tempy))
                    cout<<"此步正確"<<endl;
                else
                    cout<<"此步錯誤"<<endl;*/
                ////////////////////////////////////////////////////////////////////////////////////////正確性檢測/////////////////////////////////////////////////////////////////////////////////////
                markx=tempx;
                marky=tempy;
                step++;
                //Sleep(5000);
            }
        }
        int choice;
        printf("如果您要繼續測試，請輸入1，退出請輸入2:");
        scanf("%d",&choice);
        if(choice==1)
            continue;
        else
            break;


    }
     N=20;
    while(N--)
    {
        system("cls");
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                              謝謝您的使用！再見！                             "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                            ·                                                 "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                                                      ·                       "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        Sleep(10);
        system("cls");
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                              謝謝您的使用！再見！                             "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                            │                                                 "<<endl;
        cout<<"                         ＼    ／                                              "<<endl;
        cout<<"                       ─        ─                   │                       "<<endl;
        cout<<"                         ／    ＼                  ＼    ／                    "<<endl;
        cout<<"                            │                   ─        ─                  "<<endl;
        cout<<"                                                   ／    ＼                    "<<endl;
        cout<<"                                                      │                       "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        Sleep(10);
        system("cls");
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                              謝謝您的使用！再見！                             "<<endl;         
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                            │                                                 "<<endl;
        cout<<"                       ＼        ／                                            "<<endl;
        cout<<"                                                      │                       "<<endl;
        cout<<"                     ─            ─            ＼        ／                  "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                       ／        ＼            ─            ─                "<<endl;
        cout<<"                            │                                                 "<<endl;
        cout<<"                                                 ／        ＼                  "<<endl;
        cout<<"                                                      │                       "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        Sleep(10);
        system("cls");
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                              謝謝您的使用！再見！                             "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        Sleep(10);
    }

system("pause");
    return 0;
}

posted on 2009-02-26 11:07 abilitytao 閱讀(9279) 評論(15)  編輯 收藏 引用

評論

# re: 數學建模之——商人過河問題 算法核心:搜索法 2009-02-26 11:59 陳梓瀚(vczh)

這里可以用最短路經法。  回復  更多評論   

# re: 數學建模之——商人過河問題 算法核心:搜索法 2009-02-26 12:21 abilitytao

@陳梓瀚(vczh)
恩 開始我也想過的 可是貌似有兩種狀態吧
一種是船在南岸，一種是船在北岸，如果用dij，貌似在這里就卡住了
不知道要怎么改進才能識別這兩種狀態呢？

  回復  更多評論   

# re: 數學建模之——商人過河問題 算法核心:搜索法 2009-02-26 15:32 winsty

邊權相等的最短路啊
BFS就可以了  回復  更多評論   

# re: 數學建模之——商人過河問題 算法核心:搜索法[未登錄] 2009-02-26 17:10 abilitytao

@winsty
難道我用的不是BFS?

  回復  更多評論   

# re: 數學建模之——商人過河問題 算法核心:搜索法 2009-02-27 13:41 yindf

片尾很帥！  回復  更多評論   

# re: 數學建模之——商人過河問題 算法核心:搜索法 2009-05-04 13:06 馬文旭

有沒有C版的呢？
我怎么運行不了呢？  回復  更多評論   

# re: 數學建模之——商人過河問題 算法核心:搜索法 2009-05-04 22:25 abilitytao

@馬文旭
VC6.0肯定能運行的  回復  更多評論   

# re: 數學建模之——商人過河問題 算法核心:搜索法 2009-05-07 20:58 愛你

四個人的是不是可定能過去啊 ？  回復  更多評論   

# re: 數學建模之——商人過河問題 算法核心:搜索法 2009-05-08 01:31 abilitytao

@愛你
如果船的容量是2人的話 無解 ，3個人以上應該是可以的:-)  回復  更多評論   

# re: 數學建模之——商人過河問題 算法核心:搜索法 2009-05-22 16:41 shizhanwei

3以上怎么不行？  回復  更多評論   

# re: 數學建模之——商人過河問題 算法核心:搜索法[未登錄] 2009-05-22 17:25 abilitytao

@shizhanwei
因為無解  回復  更多評論   

# re: 數學建模之——商人過河問題 算法核心:搜索法 2009-10-28 20:06 俠客西風

這個貌似和傳教士過河一樣,我學人工智能的時候,也做過這個搜索算法...  回復  更多評論   

# re: 數學建模之——商人過河問題 算法核心:搜索法[未登錄] 2010-02-09 14:02 abilitytao

現在在一看這個搜索代碼　寫得真是差勁。。。。  回復  更多評論   

# re: 數學建模之——商人過河問題 算法核心:搜索法 2011-06-10 10:33 hyzdou

什么是搜索發，求指教。  回復  更多評論   

# re: 數學建模之——商人過河問題 算法核心:搜索法 2012-10-07 20:12 abilitytao

@hyzdou
這個代碼寫的很差 請無視吧。。  回復  更多評論   


只有注冊用戶登錄后才能發表評論。
網站導航: 博客園   IT新聞   BlogJava   博問   Chat2DB   管理


青青草原综合久久大伊人导航_色综合久久天天综合_日日噜噜夜夜狠狠久久丁香五月_热久久这里只有精品

    • <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>
            
久久精品国产亚洲精品|
亚洲欧美三级伦理|
亚洲欧美日韩国产综合在线|
亚洲精品国产精品久久清纯直播
|
伊人狠狠色丁香综合尤物|
国产麻豆综合|
国产综合亚洲精品一区二|
精品成人国产|
国产精品网站在线播放|
国产在线精品自拍|
国产日韩欧美成人|
狠狠色噜噜狠狠狠狠色吗综合|
激情久久久久|
99国产精品视频免费观看一公开|
中文一区二区|
久久精品一二三|
免费亚洲电影|
avtt综合网|
欧美一区国产一区|
欧美激情精品久久久久久黑人
|
久久精品国产77777蜜臀|
米奇777在线欧美播放|
欧美视频专区一二在线观看|
国产亚洲人成a一在线v站|
亚洲高清在线|
亚洲欧美日韩高清|
欧美激情一区二区三区在线视频
|
亚洲一区二区三区成人在线视频精品
|
亚洲天堂免费观看|
久久久久久久久久久久久女国产乱|
欧美成人午夜激情|
国产性做久久久久久|
99天天综合性|
免费久久99精品国产|
亚洲影院高清在线|
欧美日韩视频免费播放|
亚洲第一中文字幕在线观看|
午夜精品一区二区三区在线视|
免费视频一区二区三区在线观看|
亚洲线精品一区二区三区八戒|
久久久一区二区|
国产欧美精品|
一区二区国产日产|
欧美激情一区二区三区在线视频观看|
欧美亚洲网站|
国产女精品视频网站免费|
亚洲视频网在线直播|
亚洲成色最大综合在线|
中文有码久久|
欧美日韩性视频在线|
亚洲精品视频在线播放|
欧美va天堂|
老鸭窝亚洲一区二区三区|
国产亚洲激情视频在线|
先锋a资源在线看亚洲|
99在线热播精品免费|
欧美伦理在线观看|
avtt综合网|
99精品国产在热久久下载|
欧美日韩黄色一区二区|
99国产精品视频免费观看|
欧美韩日一区二区|
狼狼综合久久久久综合网
|
国产精品99久久久久久久vr|
欧美精品一区三区|
99综合视频|
亚洲精品中文字幕女同|
欧美美女日韩|
亚洲欧美另类久久久精品2019|
99精品欧美|
国产精品日日摸夜夜摸av|
欧美一区二区性|
欧美一区二区在线观看|
亚洲国产人成综合网站|
亚洲欧洲日韩在线|
国产精品久久99|
久久久久国产精品人|
久久人91精品久久久久久不卡|
在线观看欧美日本|
亚洲精品日韩综合观看成人91|
欧美日韩一区二区三区在线视频|
亚洲一区在线免费观看|
欧美淫片网站|
99re热精品|
亚洲一区在线直播|
尤妮丝一区二区裸体视频|
亚洲国产毛片完整版|
国产精品二区二区三区|
久久综合电影|
欧美日韩精品一区二区三区|
久久精品国产第一区二区三区最新章节
|
久久国产主播精品|
久久亚洲欧美国产精品乐播|
99ri日韩精品视频|
午夜视黄欧洲亚洲|
亚洲精品乱码久久久久久日本蜜臀|
亚洲精品一区在线观看|
国产欧美日本一区二区三区|
欧美电影免费观看大全|
国产精品九九|
亚洲电影自拍|
国产一区二区三区高清
|
久久久亚洲精品一区二区三区|
亚洲精品一级|
欧美在线日韩|
亚洲欧美日韩一区二区|
开元免费观看欧美电视剧网站|
性色av一区二区三区红粉影视|
另类综合日韩欧美亚洲|
亚洲欧美日韩在线不卡|
欧美成人精品1314www|
久久精品国产视频|
欧美日韩一区二区在线观看视频|
久久久精品午夜少妇|
欧美少妇一区|
亚洲国产精选|
在线观看国产日韩|
午夜伦欧美伦电影理论片|
一区二区欧美视频|
国产精品v一区二区三区|
美女精品一区|
国产精品一区二区欧美|
亚洲美女毛片|
夜夜爽av福利精品导航|
久久中文精品|
久久综合狠狠综合久久激情|
国产美女一区|
亚洲欧美国产精品va在线观看|
一本色道久久88亚洲综合88|
免费不卡在线观看av|
久久综合狠狠|
黄色精品一区|
久久精品国产在热久久|
久久久999精品|
国产日韩欧美三区|
午夜精品亚洲一区二区三区嫩草|
亚洲中无吗在线|
国产精品每日更新在线播放网址|
亚洲毛片av|
亚洲一区二区三区色|
欧美伦理视频网站|
在线亚洲欧美|
欧美一级淫片aaaaaaa视频|
国产精品亚发布|
久久成人亚洲|
欧美暴力喷水在线|
亚洲精品婷婷|
欧美日韩专区在线|
亚洲深爱激情|
欧美在线视频在线播放完整版免费观看
|
亚洲影院色无极综合|
羞羞漫画18久久大片|
国产人妖伪娘一区91|
久久国产一区二区三区|
免播放器亚洲一区|
亚洲精品在线观|
欧美性jizz18性欧美|
亚洲网站在线观看|
久久久999精品视频|
91久久精品国产91久久性色tv|
欧美高潮视频|
亚洲网站在线观看|
另类激情亚洲|
日韩视频国产视频|
国产精品亚洲第一区在线暖暖韩国|
亚洲欧美日韩国产综合精品二区
|
亚洲视频在线一区|
国产亚洲欧美日韩一区二区|
久久久久久亚洲精品中文字幕|
欧美成人官网二区|
中文欧美日韩|
伊人久久亚洲美女图片|
欧美日韩免费在线|
久久大香伊蕉在人线观看热2|
亚洲激情视频在线观看|
欧美一区二区免费|
亚洲精品在线免费|
国产亚洲欧美另类一区二区三区|
亚洲激情影院|
国产精品乱码|
久久九九免费视频|
99国产精品自拍|
久久亚洲精品一区|
亚洲字幕一区二区|
亚洲激情女人|
国产亚洲成人一区|
欧美日韩综合视频网址|
久久先锋影音av|
亚洲免费婷婷|
亚洲久久视频|
亚洲福利视频网站|
久久夜色精品国产欧美乱|
亚洲综合精品自拍|
999亚洲国产精|
亚洲激情第一页|
国内久久精品|
国产精品亚洲一区|
欧美婷婷久久|
欧美精品在线一区二区三区|
久久婷婷久久一区二区三区|