Na_OH的博客

循环队列：题目链接：cf 792B 分析：这个题就是约瑟夫环的变形，考虑到n比较小，可以用队列模拟。code：#includeconst int MAXN=100+5;int Q[MAXN];int a[MAXN];int main(void){    int n,k;scanf("%d%d",&n,&k);    for(int i=0;i     

题目：DescriptionThe police office in Tadu City decides to say ends to the chaos, as launch actions to root up the TWO gangs in the city, Gang Dragon and Gang Snake. However, the police first needs

记住，当你觉得很苦很累的时候，你真的在进步。

题目：There are n banks, numbered from 1 to n. There are also n - 1 wires connecting the banks. All banks are initially online. Each bank also has its initial strength: bank i has initial str