我の名字

线性表定义:是由同类型数据元素构成有序序列的线性结构表中元素个数称为线性表的长度线性表没有元素时，称为空表表起始的位置称为表头，表结束位置称为表尾线性表抽象数据类型描述类型名称：线性表(List)(List)(List)数据对象集：线性表是n(>=0)个元素构成的有序序列(aaa1,aaa2,aaa3…aaan)操作集：线性表L∈List ，整数 i 表示位置，元素X∈ElementType,基本操作主要有：1、List MakeEmpty(): 初始化一个空线性表L;2、E

Problem DescriptionThe only difference between easy and hard versions is the maximum value of nnn.You are given a positive integer number n. You really love good numbers so you want to find the smal...

前提：nextnextnext 数组数组第一二位一定分别为 000 , 111 , 后面求解每一位的值时，需要根据前一位进行比较。从第三位开始，将前一位与其 nextnextnext 值对应的内容进行比较，如果相等，则该位的 nextnextnext 值就是前一位的nextnextnext值加上 111 ；如果不等，向前继续寻找nextnextnext值对应的内容来与前一位进行比较，直到找到某...

Problem DescriptionThe only difference between easy and hard versions is the maximum value of nnn.You are given a positive integer number nnn. You really love good numbers so you want to find the sm...

Problem DescriptionYou are given aaa sequence a1,a2,…,ana_{1},a_{2},…,a_{n}a1​,a2​,…,an​ consisting of nnn integers.You may perform the following operation on this sequence: choose any element and ei...

Problem DescriptionMonocarp has got two strings sss and ttt having equal length. Both strings consist of lowercase Latin letters “a” and “b”.Monocarp wants to make these two strings sss and ttequal t...

Problem DescriptionSuppose there is a h×wh×wh×w grid consisting of empty or full cells. Let’s make some definitions:rir_{i}ri​ is the number of consecutive full cells connected to the left side in...

Problem Description一年在外 父母时刻牵挂春节回家 你能做几天好孩子吗寒假里尝试做做下面的事情吧陪妈妈逛一次菜场悄悄给爸爸买个小礼物主动地 强烈地 要求洗一次碗某一天早起 给爸妈用心地做回早餐如果愿意 你还可以和爸妈说咱们玩个小游戏吧 ACM课上学的呢～下面是一个二人小游戏：桌子上有M堆扑克牌；每堆牌的数量分别为Ni(i=1…M)Ni(i=1…M)Ni(i=1...

Problem Description度度熊最近很喜欢玩游戏。这一天他在纸上画了一个2行N列的长方形格子。他想把1到2N这些数依次放进去，但是为了使格子看起来优美，他想找到使每行每列都递增的方案。不过画了很久，他发现方案数实在是太多了。度度熊想知道，有多少种放数字的方法能满足上面的条件？Input第一行为数据组数T(1<=T<=100000)。然后T行，每行为一个数N(1<...

Problem DescriptionFor the daily milking, Farmer John’s NNN cows (1≤N≤50,000)(1 ≤ N ≤ 50,000)(1≤N≤50,000) always line up in the same order. One day Farmer John decides to organize a game of Ultimate ...

Problem DescriptionIvan had string s consisting of small English letters. However, his friend Julia decided to make fun of him and hid the string sss. Ivan preferred making a new string to finding th...

Problem DescriptionThe Yongzheng Emperor (131313 December 1678–81678 – 81678–8 October 173517351735), was the fifth emperor of the Qing dynasty of China. He was a very hard-working ruler. He cracked ...

Problem DescriptionGiven a rectangle frame of size n×m. Initially, the frame is strewn with n×m square blocks of size 1×11×11×1. Due to the friction with the frame and each other, the blocks are stab...

TT and FF are … friends. Uh… very very good friends -________-bFF is a bad boy, he is always wooing TT to play the following game with him. This is a very humdrum game. To begin with, TT should write...

Problem DescriptionGenerally speaking, there are a lot of problems about strings processing. Now you encounter another such problem. If you get two strings, such as “asdf” and “sdfg”, the result of t...

Problem DescriptionA tree is a well-known data structure that is either empty (null, void, nothing) or is a set of one or more nodes connected by directed edges between nodes satisfying the following...

Problem DescriptionThe i’th Fibonacci number f(i) is recursively defined in the following way:•f(0)=0f(0) = 0f(0)=0and f(1)=1f(1) = 1f(1)=1•f(i+2)=f(i+1)+f(i)f(i + 2) = f(i + 1) + f(i)f(i+2)=f(i+1...

Problem Description一块花布条，里面有些图案，另有一块直接可用的小饰条，里面也有一些图案。对于给定的花布条和小饰条，计算一下能从花布条中尽可能剪出几块小饰条来呢？Input输入中含有一些数据，分别是成对出现的花布条和小饰条，其布条都是用可见ASCII字符表示的，可见的ASCII字符有多少个，布条的花纹也有多少种花样。花纹条和小饰条不会超过1000个字符长。如果遇见#字符，则...

Problem DescriptionThe French author Georges Perec (1936–1982) once wrote a book, La disparition, without the letter’e’. He was a member of the Oulipo group. A quote from the book:Tout avait Pair n...

Problem Description给出一个只由小写英文字符a,b,c...y,za,b,c...y,za,b,c...y,z组成的字符串SSS,求SSS中最长回文串的长度.回文就是正反读都是一样的字符串,如aba,abbaaba, abbaaba,abba等Input输入有多组casecasecase,不超过120120120组,每组输入为一行小写英文字符a,b,c...y,za...