alusang的博客

第一遍笨方法模拟过的#include #include #include using namespace std;const int maxn=1e6+5;struct P{ int x; int s;}p[maxn];int main(){ memset(p,0,sizeof(p)); int n; scanf("%d

很经典的矩阵快速幂，这个题也可以求循环节#include <cstring>#include <cstdio>#include <iostream>#include <vector>#include <algorithm>#include <queue>#define INF 0x3f3f3f3fusi...