- 博客(10)
- 资源 (3)
- 收藏
- 关注
RSS订阅原创 [kuangbin带你飞]专题一 简单搜索
A POJ 1321 棋盘问题B POJ 2251 Dungeon MasterC POJ 3278 Catch That CowD POJ 3279 FliptileE POJ 1426 Find The MultipleF POJ Prime PathG POJ 3087 Shuffle'm UpH POJ 3414 PotsI FZU 2150 Fire Game
2017-11-12 00:01:10
334
原创 Educational Codeforces Round 32[题解]
比赛时只过了5道题，ABCDE。先写下题解，剩下的FG等补完题再更。A：题意：给定一个数列， 求极值点的个数。极值点定义为比相邻的两个数都大，或者都小的点。题解直接一遍扫过去判断即可。注意端点只有一个相邻的数，遍历范围为2 到 n - 1。判断条件为a[i] > a[i - 1] && a[i] > a[i + 1] || a[i] < a[i - 1] && a[i] < a[ i + 1]。#i
2017-11-10 09:45:27
250
原创 [POJ 1125]Stockbroker Grapevine[dijkstra]
Stockbroker Grapevine 【POJ 1125】 【dijkstra】
2017-08-20 22:40:25
262
2017 ccpc final
2017 CCPC Final Contest
Onsite Round, Sunday, December 3rd, 2017
Problem A. Dogs and Cages
Jerry likes dogs. He has N dogs numbered 0, 1, . . . , N − 1. He also has N cages numbered 0, 1, . . . , N − 1.
Everyday he takes all his dogs out and walks them outside. When he is back home, as dogs can’t recognize
the numbers, each dog just randomly selects a cage and enters it. Each cage can hold only one dog.
One day, Jerry noticed that some dogs were in the cage with the same number of themselves while others
were not. Jerry would like to know what’s the expected number of dogs that are NOT in the cage with
the same number of themselves.
2018-02-05
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人