qq_43735840的博客

题目链接题目描述一个吉他手准备参加一场演出。他不喜欢在演出时始终使用同一个音量，所以他决定每一首歌之前他都要改变一次音量。在演出开始之前，他已经做好了一个列表，里面写着在每首歌开始之前他想要改变的音量是多少。每一次改变音量，他可以选择调高也可以调低。音量用一个整数描述。输入文件中给定整数beginLevel，代表吉他刚开始的音量，以及整数maxLevel，代表吉他的最大音量。音量不能小于0也不能大于maxLevel。输入文件中还给定了n个整数c1,c2,c3……cn，表示在第i首歌开始之前吉他手想要改

题目链接题目描述网易云音乐推出了定时关闭播放的功能，假设到了定时关闭播放的时间，当前这首歌还没有播放完，那就把它播放完关闭；如果到了定时关闭的时间，当前歌恰好播放完，那就立即关闭。xrc 在知道网易云这个算法后，想知道如果自己定时 t 时间后关闭播放，那最多能听多长时间的歌，已知 xrc 歌单中一共有 n 首歌，并且知道每首歌的播放时间分别是 a[i]。输入描述:第一行一个整数T(T <=23)，表示数据组数。在每组输入数据中，第一行有两个正整数，n(n<= 200), t(t &

题目链接题目描述牛牛喜欢这样的数组：1：长度为n2：每一个数都在1到k之间3：对于任意连续的两个数A，B，A<=B 与（A % B != 0） 两个条件至少成立一个请问一共有多少满足条件的数组，对1e9+7取模输入描述:输入两个整数n,k1 ≤ n ≤ 101 ≤ k ≤ 100000输出描述:输出一个整数输入2 29 13 32 1234输出31151515011具体思路一开始大致知道状态转移的思路是什么，但不知为何写着写着把自己绕进去了，哭死了。设立

题目链接题目描述给你一个长度为50的数字串,问你有多少个子序列构成的数字可以被3整除答案对1e9+7取模输入描述:输入一个字符串，由数字构成，长度小于等于50输出描述:输出一个整数输入132933312345600输出317233备注:n为长度子任务1: n <= 5子任务2: n <= 20子任务3: 无限制具体思路从头到尾，每插入一个数字，查找前面字符串的子序列下有多少个子序列可以和当前插入的数字组成被3整除的子序列，因为被3整除的情况无非

题目链接DescriptionThe little cat is so famous, that many couples tramp over hill and dale to Byteland, and asked the little cat to give names to their newly-born babies. They seek the name, and at the same time seek the fame. In order to escape from such bo

题目链接Problem DescriptionIt is well known that AekdyCoin is good at string problems as well as number theory problems. When given a string s, we can write down all the non-empty prefixes of this string. For example:s: “abab”The prefixes are: “a”, “ab”, “

题目链接凸包链接DescriptionOnce upon a time there was a greedy King who ordered his chief Architect to build a wall around the King’s castle. The King was so greedy, that he would not listen to his Architect’s proposals to build a beautiful brick wall with a pe

除法分块核心代码

题目链接DescriptionNow and then you play the following game with your friend. Your friend writes down a sequence consisting of zeroes and ones. You choose a continuous subsequence (for example the subsequence from the third to the fifth digit inclusively) an

添加链接描述DescriptionA supermarket has a set Prod of products on sale. It earns a profit px for each product x∈Prod sold by a deadline dx that is measured as an integral number of time units starting from the moment the sale begins. Each product takes precis

题目链接Problem DescriptionTT 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 down a sequence of integers-_-

题目链接向量路径压缩详细代码Description动物王国中有三类动物A,B,C，这三类动物的食物链构成了有趣的环形。A吃B， B吃C，C吃A。现有N个动物，以1－N编号。每个动物都是A,B,C中的一种，但是我们并不知道它到底是哪一种。有人用两种说法对这N个动物所构成的食物链关系进行描述：第一种说法是"1 X Y"，表示X和Y是同类。第二种说法是"2 X Y"，表示X吃Y。此人对N个动物，用上述两种说法，一句接一句地说出K句话，这K句话有的是真的，有的是假的。当一句话满足下列三条之一时，这

题目链接Problem DescriptionToday is Ignatius’ birthday. He invites a lot of friends. Now it’s dinner time. Ignatius wants to know how many tables he needs at least. You have to notice that not all the friends know each other, and all the friends do not want

题目链接DescriptionSevere acute respiratory syndrome (SARS), an atypical pneumonia of unknown aetiology, was recognized as a global threat in mid-March 2003. To minimize transmission to others, the best strategy is to separate the suspects from others.In th

题目链接DescriptionAn earthquake takes place in Southeast Asia. The ACM (Asia Cooperated Medical team) have set up a wireless network with the lap computers, but an unexpected aftershock attacked, all computers in the network were all broken. The computers a

磁盘记录 n 个进行 x 路平衡归并排序内存工作区可以容纳 m 个记录磁盘每一块可存放 y 个记录可以得出有以下几个性质初始归并段有 n/m 个每个归并段存放于 m/y 个块磁盘中，这也是内存区可容纳的块数量其中缓冲输入有 (m/y)-1 个，缓冲输出有 1 个为此进行的是 (m/y)-1 路归并排序x = (m/y)-1如果在 m 路平衡归并排序过程中要求，输入、内部归并、输出三个处理同时进行的话，则需要设置 2m 个输入缓冲区和 2 个输出缓冲区...

置换-选择排序

胜败树的原理

题目链接DescriptionLike everyone else, cows like to stand close to their friends when queuing for feed. FJ has N (2 <= N <= 1,000) cows numbered 1…N standing along a straight line waiting for feed. The cows are standing in the same order as they are nu

题目链接Problem DescriptionGiven a nn matrix Cij (1<=i,j<=n),We want to find a nn matrix Xij (1<=i,j<=n),which is 0 or 1.Besides,Xij meets the following conditions:1.X12+X13+…X1n=12.X1n+X2n+…Xn-1n=13.for each i (1<i<n), satisfies ∑Xki (