Detail of message

Online Judge

Problem Set

Authors

Online Contests

User

Web Board
Home Page
F.A.Qs
Statistical Charts

Current Contest
Past Contests
Scheduled Contests
Award Contest

Re:有兴趣的同学来把玩一下这道题：

Posted by JiaJunpeng at 2015-07-28 16:47:50
In Reply To:有兴趣的同学来把玩一下这道题： Posted by:JiaJunpeng at 2015-07-28 16:46:54

> 给一个 无穷大的格子组成的平面，  平面上有N(N<=1000) 个障碍物,坐标(xi,yi)both<=10^9
> 现在要从起点(0,0)沿四个方向 走到终点(ex,ey)  ex<=10^9,ey<=10^9  
> 求最短路 以及 走法数  mod (10^9+7)

开出来了一个 O(N^2)搞法，  期待 O(n) orO(n*log(n))的，不过貌似难度暴增一个数量级。。。

Followed by:

Post your reply here:

Home Page Go Back To top