摘要：这个题是http://poj.org/problem?id=2996的反过来求的；这个题注意的就是建图；View Code #include<iostream>#include<cstdio>#include<cstdlib>#include<algorithm>#include<cmath>#include<queue>#include<set>#include<cstring>#include<vector>using namespace std;void Get_map( char 阅读全文

摘要：这是一道模拟题：要你找出黑白棋子的位置；注意要求；View Code #include<iostream>#include<cstdio>#include<cstdlib>#include<algorithm>#include<cmath>#include<queue>#include<set>#include<vector>using namespace std;void Research1( char c , char map[][35] ){ int i , j,flag=1; for( i 阅读全文

摘要：一道简单的模拟题:View Code #include<iostream>#include<cstdio>#include<cstdlib>#include<algorithm>#include<cmath>#include<queue>#include<set>#include<vector>using namespace std;int judge( char map[][124], int visit[][124],int x ,int y ,int n , int m){ if( x < 阅读全文

摘要：只是一道模拟题：题意：题目就是给定你N个机器人在规定的范围内进行操作，问你是否走出范围或者是否相撞；（如果有多个这样的情况输出最开始的那种）View Code View Code #include<iostream>#include<cstdio>#include<cstdlib>#include<algorithm>#include<cmath>#include<queue>#include<set>#include<map>#include<vector>using namespac 阅读全文

摘要：题目意思：P-sequence->代表右括号左边有几个左括号；W-sequence->代表这对括号（包括这对括号）里面有几个左括号；思路：首先对数字进行括号还原；在进行括号匹配；View Code #include<iostream>#include<cstdio>#include<cstdlib>#include<algorithm>#include<cmath>#include<queue>#include<set>#include<map>#include<vector> 阅读全文

摘要：http://openoj.awaysoft.com/JudgeOnline/problem.php?id=1567该题是一道纯模拟题，这道题比较好的解法就是用二维栈，因为每次被折的栈里面的元素都要反过来，这与栈的特性FILO是一样的，可以用栈来就行模拟。#include<stdio.h>#include<stdlib.h>typedef struct s{ int x,y; }POS;struct tt{ POS link[450]; int top; }map[24][24];int top,down,right,left;void T_ZHE(){ for( in 阅读全文