2012年10月19日
1272. Non-Yekaterinburg Subway
摘要： http://acm.timus.ru/problem.aspx?space=1&num=1272#include<iostream>#include<cstdio>#include<cstring>#include<string>#include<vector>using namespace std;const int INF=0x3f3f3f3f;const int N=10005;int f[N];int findx(int x){ if(f[x]!=x) f[x]=findx(f[x]); return f[x];}i 阅读全文
posted @ 2012-10-19 21:30 夜-> 阅读(468) 评论(0) 推荐(0)
1280. Topological Sorting
摘要： http://acm.timus.ru/problem.aspx?space=1&num=1280水题代码：#include<iostream>#include<cstdio>#include<cstring>#include<string>#include<vector>#include<queue>#include<map>#include<set>#include<stack>#include<algorithm>#include<cmath>usi 阅读全文
posted @ 2012-10-19 17:08 夜-> 阅读(329) 评论(0) 推荐(0)
1208. Legendary Teams Contest
摘要： http://acm.timus.ru/problem.aspx?space=1&num=1208水题代码：#include<iostream>#include<cstdio>#include<cstring>#include<string>#include<vector>#include<queue>#include<map>#include<set>#include<stack>#include<algorithm>#include<cmath>usi 阅读全文
posted @ 2012-10-19 16:47 夜-> 阅读(207) 评论(0) 推荐(0)
1210. Kind Spirits
摘要： http://acm.timus.ru/problem.aspx?space=1&num=1210水题代码：#include<iostream>#include<cstdio>#include<cstring>#include<string>#include<vector>#include<queue>#include<map>#include<stack>#include<algorithm>#include<cmath>using namespace std;// 阅读全文
posted @ 2012-10-19 16:12 夜-> 阅读(202) 评论(0) 推荐(0)
1136. Parliament
摘要： http://acm.timus.ru/problem.aspx?space=1&num=1136水题代码：#include<iostream>#include<cstdio>#include<cstring>#include<string>#include<vector>#include<queue>#include<map>#include<stack>#include<algorithm>#include<cmath>using namespace std;// 阅读全文
posted @ 2012-10-19 15:40 夜-> 阅读(181) 评论(0) 推荐(0)
1474. About Frogs
摘要： http://acm.timus.ru/problem.aspx?space=1&num=1474找规律 然后模拟规律： 假设隔一个跳为 jump，相邻跳为 mov （mov 分为从左向右 movl_r 和从右向左 movr_l）jump 的优先级高于 mov对于 mov 当空格在 左面 movl_r 优先级高 当空格在 右面 movr_l 优先级高 当空格在中间 优先级任意 但要始终不变。代码：#include<iostream>#include<cstdio>#include<cstring>#include<string>#incl 阅读全文
posted @ 2012-10-19 10:44 夜-> 阅读(157) 评论(0) 推荐(0)