题目:http://acm.hdu.edu.cn/showproblem.php?pid=3966 Aragorn's Story Time Limit: 10000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7658 Accepted Submission(s): 2024 Problem Description Our protagonist is the
Query on The Trees Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 4091 Accepted Submission(s): 1774 Problem Description We have met so many problems on the tree, so today we will have a que
用栈来处理一下就好了. #include<iostream> #include<algorithm> #include<cstdio> #include<cstring> #include<map> using namespace std; struct Mar { int r,c; } mar[]; int n; ]; int r,c,top,flag; Mar Stack[]; int main() { scanf("%d"
用栈来算一算就可以了. #include<iostream> #include<algorithm> #include<cstdio> #include<cstring> #include<map> using namespace std; struct Mar { int r,c; } mar[]; int n; ]; int r,c,top,flag; Mar Stack[]; int main() { while(~scanf("