JasonRaySHD的博客

1007 Maximum Subsequence Sum (25分)Given a sequence of K integers { N​1, N2, …, N​K}. A continuous subsequence is defined to be { N​i, N​i+1, …, N​j} where 1≤i≤j≤K. The Maximum Subsequence is the cont...

1105 Spiral Matrix (25分)This time your job is to fill a sequence of N positive integers into a spiral matrix in non-increasing order. A spiral matrix is filled in from the first element at the upper-...

1125 Chain the Ropes (25分)Given some segments of rope, you are supposed to chain them into one rope. Each time you may only fold two segments into loops and chain them into one piece, as shown by the...

1033 To Fill or Not to Fill (25分)With highways available, driving a car from Hangzhou to any other city is easy. But since the tank capacity of a car is limited, we have to find gas stations on the w...

二叉树：已知前序与后序建树已知前序与中序、后序与中序建树是常遇到的算法问题。若已知前序序列与后序序列，要求输出满足条件的树的个数或者输出所有可能的树的中序序列，该怎么解决？下面我们一步步讨论这个问题。首先，已知一个树的结点数n，共有多少种树形？（或者，已知一颗树的先序/中序/后序序列，共有多少种树形？）答案是Cmn/(n+1)C_{m}^{n}/(n+1)Cmn​/(n+1)种。点这里了解一...

1110 Complete Binary Tree (25分)Given a tree, you are supposed to tell if it is a complete binary tree.Input Specification:Each input file contains one test case. For each case, the first line gives...

1104 Sum of Number Segments (20分)Given a sequence of positive numbers, a segment is defined to be a consecutive subsequence. For example, given the sequence { 0.1, 0.2, 0.3, 0.4 }, we have 10 segment...

1105 Spiral Matrix (25分)This time your job is to fill a sequence of N positive integers into a spiral matrix in non-increasing order. A spiral matrix is filled in from the first element at the...

这道题的坑主要有下面几点：1、进制上界根据所给数的十进制大小确定，下界由最大数位决定。2、使用二分防止超时。3、二分时注意判断查找结果是否溢出（从某一进制转换为10进制时可能发生溢出）#include<bits/stdc++.h>using namespace std;typedef long long ll;string n1,n2;int tag;ll radi...

1、错误背景：练习DS代码——将两个有序链表归并的算法int main(){Linklist *L1,*L2,*L3,*p;①L3 = (Linklist *)malloc(sizeof(Linklist));②L1 = IncreRearin();③IncreRearin(L2);Merge(L1,L2,L3);p = L3-&amp;amp;amp;gt;next;while(p!=NULL){co...