一叶知秋

题目链接这道题本来是考类快速选择的算法的，因为题目数据太弱，导致O(nlogn)的排序算法也能AC。 下面的代码可以以平均O(n)的时间复杂度找到给定数组中第k大(0<=k<n)的元素，同时以该元素将数组左右分开。int Kth_elem(int a[],int low,int high,int k){ swap(a[low],a[(low+high)/2]); int pivot

题目地址和前面的1107类似，只是更复杂一些。 使用一个结构体Mem来记录每个人名下的财产（es),地产（area），家庭成员数（num）；借助’std::set’的去重功能，使用’set<>’记录所有出现的人的ID;使用map<int,vector<int>>记录集合根节点对应的所有子节点。并将集合中所有人的平均信息存储到该集合中ID最小的人头上，然后将其存入vector<int> final，

题目地址用vector<int>数组来记录每次输入有这个爱好的人的ID， 用map<int,int>来统计有几个集合，注意最后统计时还要进行路径压缩。//// Created by aleafall on 16-10-3.//#include<iostream>#include<cstdio>#include<algorithm>#include<map>#include<vector

题目地址#include<iostream>#include<string>#include<vector>using namespace std;const int maxn = 256;bool hashTable[maxn] = {0}; //标记是否坏键bool vis[maxn] = {0}; //标记是否输出坏键struct Key{ char c; i

1080. Graduate Admission (30)时间限制200 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueIt is said that in 2

时间限制 300 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue Input our current position and a destination, an online map can recommend several paths. Now your job is to recommend two p

时间限制 400 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue Formation is very important when taking a group photo. Given the rules of forming K rows with N people as the following:The

时间限制 400 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue The basic task is simple: given N real numbers, you are supposed to calculate their average. But what makes it complicated

Lowest Price in Supply Chain (25)时间限制 200 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue A supply chain is a network of retailers（零售商）, distributors（经销商）, and suppliers（供应商）– eve

Sum of Number Segments (20)时间限制 200 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CAO, Peng Given a sequence of positive numbers, a segment is defined to be a consecutive subsequence. For

题目地址创建二叉搜索树并输出其最低两层的节点数目，使用先序遍历，注意当树只有一层时的情况。//// Created by aleafall on 16-10-3.//#include<iostream>#include<map>using namespace std;struct Node { int data; Node *lchild, *rchild;} *root;

题目地址//// Created by aleafall on 16-9-28.//#include <iostream>using namespace std;bool isPrime(int n){ if (n<=1) return 0; for (int i = 2; i*i <= n; ++i) { if (n%i==0) return 0; }

题目地址//// Created by aleafall on 16-9-28.//#include <bits/stdc++.h>using namespace std;const int maxn = 100005;bool cmp(int a, int b) { return a > b;}int main() { int n, a[maxn]; cin >> n

Spiral Matrix (25)时间限制 150 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue This time your job is to fill a sequence of N positive integers into a spiral matrix in non-increasing o

题目地址 对于给定字符串(0~s.size())，从1到s.size()-1，向它的两边进行扩展， 对于cabad型以及cabbad型都要考虑。//// Created by aleafall on 16-11-25.//#include <iostream>#include <algorithm>#include <string>using namespace std;int main

时间限制 400 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue Given a tree, you are supposed to tell if it is a complete binary tree.Input Specification:Each input file contains one tes

题目地址直接统计，用set去重。//// Created by aleafall on 16-12-10.//#include <bits/stdc++.h>using namespace std;int main() { int n, m, x; set<int> st; cin >> n; for (int i = 0; i < n; ++i) {

题目地址 考了二叉平衡树，完全二叉树的判断，树的遍历，其中二叉平衡树写起来比较麻烦。 创建一个null结点，令所有的叶结点都指向它，这样在通过左右孩子结点更新高度时就不会访问到空指针，因为最底下就是null，而它不为空，它的高度设置为0；同时插入新结点insert(Node *&node,data)是递归插入，会插入到原树的叶结点下面，所以updateHeight()函数是从底向上一层一层更新高

题目地址要求给出的路径构成一个简单环（只有一圈），且包含所有结点才满足题目要求。 不满足要求的情况判断：路径不连通不符合要求；路径头尾结点出现次数应为2次，中间的为1次；所有点都必须出现过。//// Created by aleafall on 16-12-10.//#include <bits/stdc++.h>using namespace std;const int maxn = 205

题目地址使用map记录couple，当某人和它的另一半同时出现时，才不为single。//// Created by aleafall on 16-12-10.//#include <bits/stdc++.h>using namespace std;const int maxn = 100005;bool vis[maxn] = {0};int main() { int n, x1,

题目地址//// Created by aleafall on 16-10-2.//#include <iostream>using namespace std;const int maxn = 31;int n, index = 0;int pre[maxn], post[maxn];bool flag = true;struct Node { int data; Node

题目地址和1107,1114题类似。//// Created by aleafall on 16-9-28.//#include <iostream>#include <set>using namespace std;const int maxn = 10005;int father[maxn];int findFather(int x) { if (father[x] == x) re

1101. Quick Sort (25)时间限制200 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CAO, PengThere is a classical process named partition in

1023. Have Fun with Numbers (20)时间限制400 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueNotice that the number 123456789 is

1038. Recover the Smallest Number (30)时间限制400 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueGiven a collection of number s

#include#includeusing namespace std;const long long inf = 0x7fffffff;const int maxn = 1000001;long long a[maxn],b[maxn]; //大数组定义在main外int main(){ int n1,n2; long long max; scanf("%d",&n1);

1044. Shopping in Mars (25)时间限制100 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueShopping in Mars is quite a different exp

1037. Magic Coupon (25)时间限制100 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueThe magic shop in Mars is offering some magic

definition of a BST. You are supposed to output the level order traversal sequence of that tree. The sample is illustrated by Figure 1 and 2.Input Specification:Each input file contains on

1073. Scientific Notation (20)时间限制100 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者HOU, QimingScientific notation is the way that

1097. Deduplication on a Linked List (25)时间限制300 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueGiven a singly linked list

1056. Mice and Rice (25)时间限制30 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueMice and Rice is the name of a programming co

1070. Mooncake (25)时间限制100 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueMooncake is a Chinese bakery product traditionall

1049. Counting Ones (30)时间限制10 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueThe task is simple: given any positive intege

#include#include#include//仔细观察，合并using namespace std;bool cmp(char c1,char c2){ return c1 > c2;}int main(){ int n,n1,n2; char str[5]; scanf("%d",&n); while(1){ sprintf(str,"%04d",n);

#include //两点法，为什么必须去掉下面的判断语句#includeusing namespace std;int main(){ long long n,p; scanf("%lld %lld",&n,&p); long long a[n]; for(int i = 0;i < n;i++) scanf("%lld",&a[i]); sort(a,a+n);

1022. Digital Library (30)时间限制1000 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueA Digital Library contains millions of bo

1024. Palindromic Number (25)时间限制400 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueA number that will be the same when it

1075. PAT Judge (25)时间限制200 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueThe ranklist of PAT is generated from the status

1015. Reversible Primes (20)时间限制400 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueA reversible prime in any number system