- 博客(4)
- 收藏
- 关注
原创 CodeForces 319B
有编号为1~N的N个人站成一排(顺序是乱的),每人手中拿着一把枪。每一个时刻,每个人同时瞄准右边的人(如 果存在的话),然后如果这个人编号比自己大,则开枪将他打死。因此,一个人可能在开枪的同时被打死。一轮开 枪结束后,死亡的人视为离开了队列。那么经过多少时刻才能使得整个序列进入稳定模式—— 即不再有人死亡呢?Input第一行是N(Ou
2016-03-31 21:55:46
343
原创 codeforces 489B
#include#include#include#includeusing namespace std;int main(){#ifdef glx freopen("in.txt","r",stdin);#endif int n,m,a[150],b[150]; int dp[150][150]; while(cin>>n) { memset(dp,0,sizeof(
2016-03-30 21:19:05
326
原创 codeforces 337A
The end of the school year is near and Ms. Manana, the teacher, will soon have to say goodbye to a yet another class. She decided to prepare a goodbye present for her n students and give each of the
2016-03-30 21:14:38
307
原创 codeforces 482B Interesting Array
题目链接;http://codeforces.com/problemset/problem/482/BWe'll call an array of n non-negative integers a[1], a[2], ..., a[n]interesting, if it meets m constraints. The i-th of the m constraints consist
2016-03-30 21:06:17
241
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人