就是一个翻牌子的问题，写的略繁琐，因为只是实验室水题，所以不优化了，L是从最左翻面并且覆盖到第二堆上，以此类推，模拟就好。

1. #include"stdio.h"
2. #include"stack"
3. #include"queue"
4. usingnamespacestd;
5. intmain(intargc,charconst*argv[])
6. {
7. intn;
8. intcas=1;
9. while(~scanf("%d",&n)&&n)
10. getchar();
11. intlnum=1;
12. intrnum=n;
13. intPoker[105];
14. stack<int>s1,s2,s3;
15. charsta,ope;
16. for(inti=1;i<=n;++i)
17. scanf("%c",&sta);
18. if(sta=='D')
19. Poker[i]=0;
20. else
21. Poker[i]=1;
22. }
23. s1.push(1);
24. s2.push(n);
26. inti=1;i<n;++i)
27. if(ope=='L')
28. {
29. intj=1;j<=lnum;++j)
30. if(Poker[j])
31. Poker[j]=0;
32. Poker[j]=1;
33. lnum++;
34. if(lnum==rnum)
35. while(!s2.empty())
36. inttemp2=s2.top();
37. s2.pop();
38. s1.push(temp2);
39. }
40. while(!s1.empty())
41. inttemp1=s1.top();
42. s1.pop();
43. s3.push(temp1);
44. break;
45. queue<int>temp;
46. temp.push(lnum);
47. temp.push(temp1);
48. while(!temp.empty())
49. inttemp1=temp.front();
50. temp.pop();
51. s1.push(temp1);
52. if(ope=='R')
53. intj=n;j>=rnum;--j)
54. if(Poker[j])
55. Poker[j]=0;
56. else
57. Poker[j]=1;
58. rnum--;
59. if(lnum==rnum)
60. while(!s1.empty())
61. inttemp1=s1.top();
62. s1.pop();
63. s2.push(temp1);
64. while(!s2.empty())
65. inttemp2=s2.top();
66. s2.pop();
67. s3.push(temp2);
68. break;
69. int>temp;
70. temp.push(rnum);
71. temp.push(temp2);
72. while(!temp.empty())
73. inttemp2=temp.front();
74. temp.pop();
75. s2.push(temp2);
76. printf("Pile%d\n",cas++);
77. intnum;
78. inta[1000];
79. intb[1000];
80. intbnum=1;
81. while(!s3.empty())
82. inttemp=s3.top();
83. b[bnum++]=temp;
84. s3.pop();
85. scanf("%d",&num);
86. inti=0;i<num;++i)
87. printf("Card%disaface",a[i]);
88. if(Poker[b[a[i]]])
89. printf("up");
90. printf("down");
91. printf("%d.\n",b[a[i]]);
93. return0;
94. }