feng_zhiyu的博客

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 20737 Accepted Submission(s): 12434Problem Description The inversion number of a given n...

题目链接According to Wikipedia:Insertion sort iterates, consuming one input element each repetition, and growing a sorted output list. Each iteration, insertion sort removes one element from the input ...

题目链接According to Wikipedia:Insertion sort iterates, consuming one input element each repetition, and growing a sorted output list. Each iteration, insertion sort removes one element from the input...

题目链接A linked list consists of a series of structures, which are not necessarily adjacent in memory. We assume that each structure contains an integer key and a Next pointer to the next structure. No...

题目链接Given a collection of number segments, you are supposed to recover the smallest number from them. For example, given {32, 321, 3214, 0229, 87}, we can recover many numbers such like 32-321-3214-...

Time Limit: 1 Sec Memory Limit: 128 MB Description 求第k大的数，比如{1,2,3,4,5} 第1大的为5，第2大的为4….第5大的为1为了节省IO时间，输入数据采用如下函数生成，n,A,B,c是输入，res是输出数列，n表示要生成数列的个数。 void Create(long long res[],int n,unsigned int...

原题链接 题意：给两个长度为n的序列Ai,Bi，求所有数(Ai + Bj)的异或和，i,j∈[0,n)。被某大佬告知这是原题【hdu5270】，就去学习了下。 原始题解没找到，然后贴了份题解。 题解： 我们考虑两个数A，B。 为了描述方便，我们设[P]的值为：当表达式P的值为真时，[P]=1，否则[P]=0 我们现在考虑计算[(A+B)and(2i)>0] 首先我们将A,...

时间限制：1.0s 内存限制：512.0MB 提交此题 　　问题描述 　　编写一个程序，读入一组整数，这组整数是按照从小到大的顺序排列的，它们的个数N也是由用户输入的，最多不会超过20。然后程序将对这个数组进行统计，把出现次数最多的那个数组元素值打印出来。如果有两个元素值出现的次数相同，即并列第一，那么只打印比较小的那个值。 　　输入格式：第一行是一个整数N，N £ 20；接下来有

归并排序步骤： 1.划分子问题 2.递归求解 3.合并分治法分一种 时间复杂度：O(nlogn) 比快速排序更稳定 缺点：1.用到辅助空间，空间消耗更大 2.需要复制回原数组#include<cstdio>#include<cstring>#include<algorithm>using namespace std;const int N=1e5+5;in

题目链接Given a list of N student records with name, ID and grade. You are supposed to sort the records with respect to the grade in non-increasing order, and output those student records of which the g...