排序:
默认
按更新时间
按访问量
RSS订阅

A1017 Queueing at Bank (25 分)(银行排队)(简单模拟)(时间转化)

Suppose a bank hasKwindows open for service. There is a yellow line in front of the windows which devides the waiting area into two parts. All the cu...

2019-03-11 15:25:39

阅读数 115

评论数 0

A1057 Stack (30 分)(进栈出栈的同时求栈中元素的中位数)(分块)(难)

Stack is one of the most fundamental data structures, which is based on the principle of Last In First Out (LIFO). The basic operations include Push ...

2019-03-11 13:14:55

阅读数 17

评论数 0

A1091 Acute Stroke (30 分)(三维图形)(BFS)(难)

One important factor to identify acute stroke (急性脑卒中) is the volume of the stroke core. Given the results of image analysis in which the core regions...

2019-03-09 15:04:03

阅读数 8

评论数 0

A1022 Digital Library (30 分)(map + set)

A Digital Library contains millions of books, stored according to their titles, authors, key words of their abstracts, publishers, and published year...

2019-03-08 22:55:50

阅读数 17

评论数 0

A1010 Radix (25 分)(二分)(难)

Given a pair of positive integers, for example, 6 and 110, can this equation 6 = 110 be true? The answer isyes, if 6 is a decimal number and 110 is a...

2019-03-07 16:59:57

阅读数 22

评论数 0

A1033 To Fill or Not to Fill (25 分)(加油站问题)(贪心)(难)

With highways available, driving a car from Hangzhou to any other city is easy. But since the tank capacity of a car is limited, we have to find gas ...

2019-03-07 11:31:31

阅读数 45

评论数 0

A1080 Graduate Admission (30 分)(考生志愿与录取)(难)

It is said that in 2011, there are about 100 graduate schools ready to proceed over 40,000 applications in Zhejiang Province. It would help a lot if ...

2019-03-06 19:06:32

阅读数 30

评论数 0

A1075 PAT Judge (25 分)(根据提交信息排序)(难)

Input Specification: 每个输入文件包含一个测试用例。对于每种情况,第一行包含3个正整数,n(≤10^4) 用户总数,k(≤5)问题总数,m(≤10^5)提交的总数。然后假设用户ID是从00001到N的5位数字,问题ID是从1到K。 下一行包含k个正整数p[i](i=1,…,...

2019-03-06 17:31:24

阅读数 16

评论数 0

A1016 Phone Bills (25 分)(计算话费)(排序)

A long-distance telephone company charges its customers by the following rules: Making a long-distance call costs a certain amount per minute, depen...

2019-03-06 15:20:31

阅读数 12

评论数 0

A1082 Read Number in Chinese (25 分)(用拼音读数字)

Given an integer with no more than 9 digits, you are supposed to read it in the traditional Chinese way. OutputFufirst if it is negative. For example...

2019-03-05 20:13:33

阅读数 45

评论数 0

A1068 Find More Coins (30 分)(01背包问题)(难)

1068Find More Coins(30 分) Eva loves to collect coins from all over the universe, including some other planets like Mars. One day she visited a unive...

2019-03-01 12:08:03

阅读数 24

评论数 0

A1040 Longest Symmetric String (25 分)(最长回文子串)(DP)

Given a string, you are supposed to output the length of the longest symmetric sub-string. For example, givenIs PAT&TAP symmetric?, the l...

2019-02-28 18:33:10

阅读数 20

评论数 0

A1045 Favorite Color Stripe (30 分)(最长不下降子序列问题)(DP)

Eva is trying to make her own color stripe out of a given one. She would like to keep only her favorite colors in her favorite order by cutting off t...

2019-02-27 17:45:41

阅读数 16

评论数 0

A1007 Maximum Subsequence Sum (25 分)(最大连续子序列和)(DP问题)

Given a sequence ofKintegers {N​1​​,N​2​​, ...,N​K​​}. A continuous subsequence is defined to be {N​i​​,N​i+1​​, ...,N​j​​} where1≤i≤j≤K. The Maximum...

2019-02-27 16:26:23

阅读数 16

评论数 0

A1003 Emergency (25 分)(Dijsktra算法)(难)

As an emergency rescue team leader of a city, you are given a special map of your country. The map shows several scattered cities connected by some r...

2019-02-26 17:44:17

阅读数 58

评论数 0

A1076 Forwards on Weibo (30 分)(L层之内的转发数)(图的BFS)

Weibo is known as the Chinese version of Twitter. One user on Weibo may have many followers, and may follow many other users as well. Hence a social ...

2019-02-26 14:02:57

阅读数 9

评论数 0

A1034 Head of a Gang (30 分)(树的DFS)(邻接矩阵)(难)

One way that the police finds the head of a gang is to check people's phone calls. If there is a phone call betweenAandB, we say thatAandBis related....

2019-02-26 12:54:25

阅读数 11

评论数 0

A1021 Deepest Root (25 分)(选出使整棵树高度最大的树根节点)(图的DFS)

A graph which is connected and acyclic can be considered a tree. The height of the tree depends on the selected root. Now you are supposed to find th...

2019-02-25 21:28:22

阅读数 104

评论数 0

A1013 Battle Over Cities (25 分)(删除图的一个节点需要添加几条边连通)(图的DFS)(邻接表存储)

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 ...

2019-02-25 19:43:37

阅读数 107

评论数 0

A1107 Social Clusters (30 分)(求形成几个社交网络)(并查集)(难)

When register on a social network, you are always asked to specify your hobbies in order to find some potential friends with the same hobbies. Asocia...

2019-02-25 17:44:44

阅读数 13

评论数 0

提示
确定要删除当前文章?
取消 删除
关闭
关闭