junior19的博客

Your company provides robots that can be used to pick up litter from fields after sporting events andconcerts. Before robots are assigned to a job, an aerial photograph of the field is marked with a

Super Jumping! Jumping! Jumping!Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 35724    Accepted Submission(s): 16264Problem Descri

1046: [HAOI2007]上升序列Time Limit: 10 Sec  Memory Limit: 162 MBSubmit: 5425  Solved: 1883[Submit][Status][Discuss]Description　　对于一个给定的S={a1,a2,a3,…,an},若有P={ax1,ax2,ax3,…,axm},满足(x1 2 出S序

LIS2 - Another Longest Increasing Subsequence Problemno tags  Given a sequence of N pairs of integers, find the length of the longest increasing subsequence of it.An increasing sequence A1..An...

题目背景勤奋又善于思考的小L接触了信息学竞赛，开始的学习十分顺利。但是，小L对数据结构的掌握实在十分渣渣。所以，小L当时卡在了二叉树。题目描述在计算机科学中，二叉树是每个结点最多有两个子结点的有序树。通常子结点被称作“左孩子”和“右孩子”。二叉树被用作二叉搜索树和二叉堆。随后他又和他人讨论起了二叉搜索树。什么是二叉搜索树呢？二叉搜索树首先是一棵二叉树。设key[p]表示结点p上的数...