算法
李木木乃伊
尘世中一个迷途小书童,关注计算机视觉,深度学习,AIGC。
展开
-
1014. Waiting in Line (30)
解题思路:对于每个window都要标记它的poptime和endtime,poptime最小的决定于N*M后的人进哪个队列,endtime用来计算自己的服务结束时间。原创 2017-03-17 17:44:20 · 419 阅读 · 0 评论 -
1012. The Best Rank (25)
改日添加讲解 To evaluate the performance of our first year CS majored students, we consider their grades of three courses only: C - C Programming Language, M - Mathematics (Calculus or Linear Algebra), and原创 2017-03-14 14:34:35 · 268 阅读 · 0 评论 -
1008. Elevator (20)
The highest building in our city has only one elevator. A request list is made up with N positive numbers. The numbers denote at which floors the elevator will stop, in specified order. It costs 6 seco原创 2017-03-14 14:33:18 · 244 阅读 · 0 评论 -
1011. World Cup Betting (20)
With the 2010 FIFA World Cup running, football fans the world over were becoming increasingly excited as the best players from the best teams doing battles for the World Cup trophy in South Africa. Sim原创 2017-03-10 10:02:42 · 255 阅读 · 0 评论 -
1009. Product of Polynomials (25)
This time, you are supposed to find A*B where A and B are two polynomials.Input Specification:Each input file contains one test case. Each case occupies 2 lines, and each line contains the information原创 2017-03-09 15:18:56 · 211 阅读 · 0 评论 -
1003. Emergency (25) 最短路问题
Dijkstra算法可以解决最短路问题,针对单源有向图,属于贪心算法的一种,要求权值非负。算法实现步骤: 初始化:起点dist[s]=0 其他dist[i]=INF 节点集合V[i]=0 注:C++中初始化最大值,如果设置为FFFFFFFF其实有问题,就像在这个问题中,如果将最大值加一,则出现了负原创 2017-03-07 15:54:12 · 646 阅读 · 0 评论 -
1007. Maximum Subsequence Sum (25) 求最大连续子序列和
这道题比较简单,但是要注意细节,比如max的初始化值,比如对于输入是负数和零的情况。 Given a sequence of K integers { N1, N2, …, NK }. A continuous subsequence is defined to be { Ni, Ni+1, …, Nj } where 1 <= i <= j <= K. The Maximum Subsequen原创 2017-03-09 13:08:57 · 218 阅读 · 0 评论 -
1006. Sign In and Sign Out (25)
At the beginning of every day, the first person who signs in the computer room will unlock the door, and the last one who signs out will lock the door. Given the records of signing in’s and out’s, you原创 2017-03-08 18:20:46 · 251 阅读 · 0 评论 -
1005. Spell It Right (20) 数字之和转英文输出
Given a non-negative integer N, your task is to compute the sum of all the digits of N, and output every digit of the sum in English.Input Specification:Each input file contains one test case. Each cas原创 2017-03-08 17:33:33 · 324 阅读 · 0 评论 -
1004. Counting Leaves (30) 树的遍历 DFS BFS
递归自己掌握的并不熟练,所以要多做一些树的题目了,来看一下今天的题目吧!A family hierarchy is usually presented by a pedigree tree. Your job is to count those family members who have no child. InputEach input file contains one test case原创 2017-03-08 16:47:08 · 333 阅读 · 0 评论 -
1013. Battle Over Cities (25)
It is vitally important to have all the cities connected by highways in a war. If a city is occupied by the enemy, all the highways from/toward that city are closed. We must know immediately if we need原创 2017-03-14 14:36:15 · 343 阅读 · 0 评论