2018杭电多校
AC-NEWBIE
得之淡然 失之坦然
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
2018 Multi-University Training Contest 1-D-Distinct Values
(一)题面: Problem Description Chiaki has an array of n positive integers. You are told some facts about the array: for every two elements ai and aj in the subarray al..r (l≤i<j≤r), ai≠aj holds. Chia...原创 2018-07-24 10:25:42 · 341 阅读 · 0 评论 -
2018 Multi-University Training Contest 1-B-Balanced Sequence
(一)题面: Problem Description Chiaki has n strings s1,s2,…,sn consisting of '(' and ')'. A string of this type is said to be balanced: + if it is the empty string + if A and B are balanced, AB is balan...原创 2018-07-24 16:53:02 · 258 阅读 · 0 评论 -
2018 Multi-University Training Contest 1-H-RMQ Similar Sequence
(一)题面: Problem Description Chiaki has a sequence A={a1,a2,…,an}. Let RMQ(A,l,r) be the minimum i (l≤i≤r) such that ai is the maximum value in al,al+1,…,ar. Two sequences A and B are called {RMQ Simi...原创 2018-07-25 19:22:06 · 222 阅读 · 0 评论 -
2018 Multi-University Training Contest 2-G-Naive Operations
题目链接:HDU6135-Naive Operations (一)题面: Problem Description In a galaxy far, far away, there are two integer sequence a and b of length n. b is a static permutation of 1 to n. Initially a is filled wi...原创 2018-07-26 22:42:01 · 247 阅读 · 0 评论 -
2018 Multi-University Training Contest 2-C-Cover
题目链接:HDU6311-Cover (一)题面: Problem Description The Wall has down and the King in the north has to send his soldiers to sentinel. The North can be regard as a undirected graph (not necessary to be co...原创 2018-07-27 01:43:27 · 341 阅读 · 0 评论 -
2018 Multi-University Training Contest 5-G-Glad You Came
题目链接:HDU-6356-Glad You Came (一)题面: Problem Description Steve has an integer array a of length n (1-based). He assigned all the elements as zero at the beginning. After that, he made m operations, e...原创 2018-08-07 00:04:22 · 427 阅读 · 0 评论 -
2018 Multi-University Training Contest 4-B-Harvest of Apples
题目链接:HDU-6336-Harvest of Apples (一)题面: Problem Description There are n apples on a tree, numbered from 1 to n. Count the number of ways to pick at most m apples. Input The first line of the in...原创 2018-08-02 22:30:43 · 210 阅读 · 0 评论
分享