摘要:
#include <iostream>#include <stdio.h>#include <queue>using namespace std;const int maxn=(int)1e6+10;const int maxm=(int)5e5+10;struct trie{ int nxt[ma 阅读全文
摘要:
Task Schedule Problem Description Our geometry princess XMM has stoped her study in computational geometry to concentrate on her newly opened factory. 阅读全文
摘要:
1 4 10 88 0 30 1 2 40 1 3 2 3 4 10 #include #include #include #include #define fi first #define se second using namespace std; const int maxn=(int)1e6 +10; int n,ans; int cost[maxn]; int val... 阅读全文