Codeforces Beta Round #79 (Div. 1 Only), problem: (B) Buses 路径DP
题意:某个人要从1站乘车到n站,图中可以搭乘公交车,而且一旦上车,中途无法下车做法:路径DP,可是一时疏忽啊。。。。要DP每个点才行#include
#include
#include
#include
#definemod1000000007
#defineLLlonglong
constintLMT=100003;
usingnamespacestd;
structstop
{
ints,t,