申屠志刚

分类

ACM(1) C(128) C++(380) C.++(1) CTF(44) C语言(34) DP(4) JAVA(2) Python(1) 博弈论(1) 并查集(2) 最小生成树(1) 最短路(2) 未归档(435) 浙江理工大学2018年10月赛(2) 生成树(1) 申屠志刚的ACM之路(37) 申屠志刚的CTF之路(2) 矩阵(1) 线段树(1) 经典问题(1) 背包问题(1) 语法(1)

/ 注册

全部文章（共1083篇）

Wormholes

While exploring his many farms, Farmer John has discovered a number of amazing wormholes. A wormhole is very peculiar because it is a one-way path ...

C 最短路 SPFA

2018-10-24

0 651

Arbitrage

Arbitrage is the use of discrepancies in currency exchange rates to transform one unit of a currency into more than one unit of the same currency. For...

C 最短路问题 Floyd

2018-10-23

0 652

Currency Exchange

Several currency exchange points are working in our city. Let us suppose that each point specializes in two particular currencies and performs exchang...

C

2018-10-23

0 0

Choose the best route

One day , Kiki wants to visit one of her friends. As she is liable to carsickness , she wants to arrive at her friend’s home as soon as possible . Now...

C 最短路问题

2018-10-23

0 0

Heavy Transportation

Background Hugo Heavy is happy. After the breakdown of the Cargolifter project he can now expand business. But he needs a clever man who tells him wh...

C 最短路问题

2018-10-23

0 0

最短路

在每年的校赛里，所有进入决赛的同学都会获得一件很漂亮的t-shirt。但是每当我们的工作人员把上百件的衣服从商店运回到赛场的时候，却是非常累的！所以现在他们想要寻找最短的从商店到赛场的路线，你可以帮助他们吗？ Input 输入包括多组数据。每组数据第一行是两个整数N、M（N<=100...

C 最短路问题

2018-10-23

0 527

最短路径问题

给你n个点，m条无向边，每条边都有长度d和花费p，给你起点s终点t，要求输出起点到终点的最短距离及其花费，如果最短距离有多条路线，则输出花费最少的。 Input 输入n,m，点的编号是1~n,然后是m行，每行4个数 a,b,d,p，表示a和b之间有一条边，且其长度为d，花费为p。最后一行是两个数...

C

2018-10-23

0 556

Buying A House

Zane the wizard had never loved anyone before, until he fell in love with a girl, whose name remains unknown to us. ...

C 最短路

2018-10-22

0 0

Robberies

The aspiring Roy the Robber has seen a lot of American movies, and knows that the bad guys usually gets caught in the end, often because they become t...

C 背包问题

2018-10-21

0 0

最长上升子序列（Longest increasing subsequence）

问题描述对于一串数A={a1a2a3…an}，它的子序列为S={s1s2s3…sn}，满足{s1<s2<s3<…<sm}。求A的最长子序列的长度。动态规划法算法描述：设数串的长度为n，L[i]为以第i个数为末尾的最长上升子序列...

2018-10-21

0 555