• 16.2.2火车站售票系统模拟程序(CriticalSection)


    #include<iostream>
    #include<Windows.h>
    using namespace std;

    DWORD WINAPI ThreadProc1(LPVOID lpParameter);
    DWORD WINAPI ThreadProc2(LPVOID lpParameter);

    CRITICAL_SECTION CriticalSection;
    int tickets = 100;

    int main()
    {
     InitializeCriticalSection(&CriticalSection);
     HANDLE hThread1 = CreateThread(NULL,0,ThreadProc1,NULL,0,NULL);
     HANDLE hThread2 = CreateThread(NULL,0,ThreadProc2,NULL,0,NULL);


     Sleep(4000);
     DeleteCriticalSection(&CriticalSection);

    CloseHandle(hThread1);

    CloseHandle(hThread2);

     return 0;
    }

    DWORD WINAPI ThreadProc1(LPVOID lpParameter)
    {
     while(TRUE)
     {
      EnterCriticalSection(&CriticalSection);
      Sleep(1);
      if(tickets > 0)
      {
       Sleep(1);
       cout<<"ThreadProc1 sells "<<tickets--<<endl;
       LeaveCriticalSection(&CriticalSection);
      }
      else
      {
       LeaveCriticalSection(&CriticalSection);
       break;
      }
     }
     return 0;
    }

    DWORD WINAPI ThreadProc2(LPVOID lpParameter)
    {
     while(TRUE)
     {
      EnterCriticalSection(&CriticalSection);
      Sleep(1);
      if(tickets > 0)
      {
       Sleep(1);
       cout<<"ThreadProc2 sells "<<tickets--<<endl;
       LeaveCriticalSection(&CriticalSection);
      }
      else
      {
       LeaveCriticalSection(&CriticalSection);
       break;
      }
     }
     return 0;
    }

    //临界区要在线程执行前初始化,因为线程一但被建立即开始运行(除非手工挂起),但线程建立后在初始化临界区可能出现问题

  • 相关阅读:
    NOJ-1581 筷子 (线性DP)
    UVA-242 Stamps and Envelope Size (DP)
    POJ 1860 (SPFA判断正环)
    POJ 3268 最短路水题
    STL----priority_queue
    STL----unique
    POJ 2031(最小生成树Kruskal算法+几何判断)
    POJ 3468(线段树区间修改+区间求和)
    学习线段树
    POJ 1251(最小生成树裸题)
  • 原文地址:https://www.cnblogs.com/BeyondTechnology/p/1813096.html
Copyright © 2020-2023  润新知