![](https://img-blog.csdnimg.cn/20201014180756930.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
竞赛算法
常用算法
甜甛恬栝湉铦i
这个作者很懒,什么都没留下…
展开
-
D. Least Cost Bracket Sequence
D. Least Cost Bracket Sequencetime limit per test1 secondmemory limit per test64 megabytesinputstandard inputoutputstandard outputThis is yet another problem on regular bracket sequences.A bracket sequence is called regular, if by inserting “+” and “原创 2020-05-29 14:34:02 · 165 阅读 · 0 评论 -
C. Tic-tac-toe
C. Tic-tac-toetime limit per test1 secondmemory limit per test64 megabytesinputstandard inputoutputstandard outputCertainly, everyone is familiar with tic-tac-toe game. The rules are very simple indeed. Two players take turns marking the cells in a 3原创 2020-05-19 20:36:47 · 309 阅读 · 1 评论 -
B. Lorry(爆搜二分)
B. Lorrytime limit per test2 secondsmemory limit per test64 megabytesinputstandard inputoutputstandard outputA group of tourists is going to kayak and catamaran tour. A rented lorry has arrived to the boat depot to take kayaks and catamarans to the po原创 2020-05-19 20:32:30 · 337 阅读 · 0 评论 -
C. Commentator problem
C. Commentator problemtime limit per test1 secondmemory limit per test64 megabytesinputstandard inputoutputstandard outputThe Olympic Games in Bercouver are in full swing now. Here everyone has their own objectives: sportsmen compete for medals, and s原创 2020-05-11 20:53:53 · 180 阅读 · 0 评论 -
B. The least round way
B. The least round waytime limit per test2 secondsmemory limit per test64 megabytesinputstandard inputoutputstandard outputThere is a square matrix n × n, consisting of non-negative integer numbers. You should find such a way on it thatstarts in the原创 2020-05-08 20:17:46 · 246 阅读 · 0 评论 -
1C. Ancient Berland Circus
C. Ancient Berland Circustime limit per test2 secondsmemory limit per test64 megabytesinputstandard inputoutputstandard outputNowadays all circuses in Berland have a round arena with diameter 13 ...原创 2020-05-08 13:34:16 · 174 阅读 · 0 评论 -
动态规划-特别法官
题目描述大概是如下:在游戏开始的时候给每个参与者一个令牌,此人以一定的概率将令牌传递给左侧相邻的人或者右侧相邻的人。接受令牌的人接着做同样的事情,依次类推。当每个人至少收到令牌一次时,游戏结束。最后一位获得令牌的人获胜。找出给定人物获胜的可能性,对于每个人来说,令牌向左或者向右传递的概率是独立的,并且在游戏开始之前是预先知道的。参赛人员的标号从1到n。2号在1号的右侧,3号在2号的右侧,依次类...原创 2020-01-09 19:30:42 · 138 阅读 · 0 评论