2015 年 9月 19 日随笔档案 - Pat

2015年9月19日

摘要： Problem 给出一个不带边权（即边权为1）的有向无环图（unweighted DAG）以及DAG上两点s, t，求s到t的最短距离,如果无法从s走到t，则输出-1。 Solution DFS，BFS都可，对于unweighted DAG, BFS更合适，下面给出DFS解法。对于weighted 阅读全文

posted @ 2015-09-19 22:47 Pat 阅读(371) 评论(0) 推荐(0) 编辑

Codeforces 578B "Or" Game

摘要：传送门 You are given $n$ numbers $a_1, a_2, \dots, a_n$. You can perform at most $k$ operations. For each operation, you can multiply one of the numbers 阅读全文

posted @ 2015-09-19 08:27 Pat 阅读(359) 评论(0) 推荐(0) 编辑

Pat

「以解决问题为乐」

真的喜欢么？真的喜欢就去做吧。

Lost Boy Calling 。。。。

... Many of these issues are best dealt with at the algorithmic level, rather than by "tweaking" the code.

This is an obscurity that catches the unwary.

原来我什么都不懂。

公告

Pat

「以解决问题为乐」 真的喜欢么？真的喜欢就去做吧。 Lost Boy Calling 。。。。 ... Many of these issues are best dealt with at the algorithmic level, rather than by "tweaking" the code. This is an obscurity that catches the unwary. 原来我什么都不懂。

公告

「以解决问题为乐」

真的喜欢么？真的喜欢就去做吧。

Lost Boy Calling 。。。。

... Many of these issues are best dealt with at the algorithmic level, rather than by "tweaking" the code.

This is an obscurity that catches the unwary.

原来我什么都不懂。