摘要:
POJ 3255 #include <iostream> #include <string.h> #include <algorithm> #include <stdio.h> #include <stdlib.h> #include <vector> #include <queue> #inclu 阅读全文
摘要:
#include<cstdio> const int maxn = 50000+10; int p[maxn]; //存父节点 int r[maxn];//存与父节点的关系 0 同一类,1被父节点吃,2吃父节点 void set(int n) //初始化 { for(int x = 1; x <= 阅读全文
摘要:
Expedition Time Limit: 1000MS Memory Limit: 65536K Description A group of cows grabbed a truck and ventured on an expedition deep into the jungle. Bei 阅读全文