PAT顶级解题笔记
文章平均质量分 88
Breezewords
这个作者很懒,什么都没留下…
展开
-
T1009 Triple Inversions
T1009 Triple Inversions文章目录T1009 Triple Inversions题目大意题目限制条件本题考察知识点解题思路AC代码题目大意如果在一个序列A中存在i<j<k, 且A_i>A_j>A_k,则(A_i, A_j, A_k)是一个三元逆序对。现要求统计给定数组中的三元逆序对的数量。题目限制条件时间限制:300ms内存限制:64MB本题考察知识点树状数组解题思路用树状数组求二元逆序对是一道很经典的题。我们回顾一下求二元逆序对的过程原创 2022-04-27 09:45:06 · 197 阅读 · 0 评论 -
T1028 Do All Roads Lead to Rome (35 point(s))
T1028 Do All Roads Lead to Rome (35 point(s))题干Indeed there are many different tourist routes from our city to Rome. Your job is to count the number of different routes from our city to Rome, and to check if ALL the routes lead to Rome – that is, whether原创 2022-04-22 15:21:42 · 379 阅读 · 1 评论 -
T1008 Airline Routes (35 point(s))
T1008 Airline Routes (35 point(s))题干Given a map of airline routes, you are supposed to check if a round trip can be planned between any pair of cities.Input Specification:Each input file contains one test case. For each case, the first line gives two p原创 2022-04-17 16:28:59 · 155 阅读 · 0 评论 -
T1001 Battle Over Cities - Hard Version (35 point(s))
PAT顶级解题笔记(附思路和代码)原创 2022-04-17 16:25:37 · 180 阅读 · 0 评论 -
T1015 Letter-moving Game (35 point(s))
PAT顶级解题笔记(附思路和代码)原创 2022-04-17 15:06:33 · 266 阅读 · 0 评论 -
T1022 Werewolf (35 point(s))
PAT顶级解题笔记(附思路和代码)原创 2022-04-17 15:00:26 · 258 阅读 · 0 评论