摘要:
#include<cstdio>//https://vijos.org/p/1540 #include<cstring>#include<iostream>using namespace std;int n,m;int h[10000];int father[10000];int found(int 阅读全文
posted @ 2016-02-14 22:00
Minepressure
阅读(181)
评论(0)
推荐(0)
摘要:
#include<cstdio>//https://vijos.org/p/1790 #include<iostream>#include<vector>#include<queue>using namespace std;const int MAXN=500;int n,m;vector<int> 阅读全文
posted @ 2016-02-14 21:59
Minepressure
阅读(252)
评论(0)
推荐(0)
摘要:
#include<iostream>using namespace std;#include<cstdio>#include<cstring>#define maxn 10000+10short book[maxn]={0},x,y,s[maxn],top=0;short du[maxn]={0}; 阅读全文
posted @ 2016-02-14 17:21
Minepressure
阅读(152)
评论(0)
推荐(0)
摘要:
#include<cstdio>#include<vector>using namespace std;int n,m,x,y,head=-1,tail=-1;const int maxn=5000;vector<int>map[maxn];int rudu[maxn];int p[maxn];in 阅读全文
posted @ 2016-02-14 17:19
Minepressure
阅读(102)
评论(0)
推荐(0)

浙公网安备 33010602011771号