10 2022 档案
摘要：##题面 You are given an array a consisting of n integers numbered from 1 to n. Let’s define the k-amazing number of the array as the minimum number that
阅读全文
摘要：##题面 Eugene likes working with arrays. And today he needs your help in solving one challenging task. An array cc is a subarray of an array bb if cc ca
阅读全文
摘要：##题面 Dark is going to attend Motarack’s birthday. Dark decided that the gift he is going to give to Motarack is an array a of n non-negative integers.
阅读全文
摘要：##题面 A sequence a=[a1,a2,…,al] of length l has an ascent if there exists a pair of indices (i,j) such that 1≤i<j≤l and ai<aj. For example, the sequenc
阅读全文
摘要：###题面 Now that Kuroni has reached 10 years old, he is a big boy and doesn't like arrays of integers as presents anymore. This year he wants a Bracket
阅读全文
摘要：##Codeforces Round #620(Div.2) Longest Palindrome ###题面 Returning back to problem solving, Gildong is now studying about palindromes. He learned that
阅读全文
摘要：##题面 [传送门]（http://poj.org/problem?id=1958） 简言之就是解出n个盘子4座塔的Hanoi问题最少需要多少步 ##分析 对于三塔经典Hanoi问题，有 原理是第一步把n-1个盘子放在另一个塔子上
阅读全文
摘要：##题面 传送门[https://www.acwing.com/problem/content/description/97/] ##分析 考虑逐行分析，以行递推 如果不再改变第一行，则满足题意的点击方案最多1种 理由是：如果第i行某一位为0，由于第i行固定，只能点击第i+1行这个位置才能将其改变为
阅读全文
