我用临接表模拟容器超时 #include<stdio.h> #include<string.h> #include<vector> using namespace std; #define N 110000 vector<int>q[N]; int f[N]; int main() { int t,n,m,i,j,k,a,b; scanf("%d",&t); while(t--) { scanf("%d%d",…
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4772 题面: Zhuge Liang's Password Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1404 Accepted Submission(s): 926 Problem Description In the anc…
题目: 士兵队列训练问题 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 56 Accepted Submission(s): 37 Problem Description 某部队进行新兵队列训练,将新兵从一開始按顺序依次编号,并排成一行横队.训练的规则例如以下:从头開始一至二报数.凡报到二的出列,剩下的向小序号方向靠拢,再从头開始进行一…