摘要： #include <iostream>#include <cstdio>using namespace std;const int MOD = 3761599;const int MAXN = 1100010;int e[MAXN], f[MAXN], temp[MAXN];void init(){ long long t = 1; for (int i = 1; i < MAXN; i++) { t *= i; t = t % MOD; temp[i] = t; } temp[0] = 1;}int gcd(int a,... 阅读全文

摘要： 堆栈，单调队列#include<iostream>#include<queue>#include<algorithm>#include<stdio.h>#include<cmath>using namespace std;#define MAXN 500000000struct Point{ int val,pos;};int n,m,x,t;int dp[101][10010];int g[101][10010];int dist[10010];bool operator < (Point a,Point b){ return 阅读全文