L-qf 的博客

1）首先最简单的就是模拟时间复杂度是O(n^3)/*最大连续和问题O(n^3)*/#include<cstdio>#include<iostream>using namespace std;int main() { int a[1005],n,sum,ans; while(~scanf("%d",&n)) { for(int i=1; i...

/*归并排序实现 求逆序数 O(nlogn)*/#include<cstdio>#include<iostream>#include<algorithm>#define N 1005using namespace std;int a[N],t[N],cnt;void merge_sort(int *a,int x,int y,int *t)...

/*二分查找，左闭右开区间注意查找的数组一定是有序的*/#include<cstdio>#include<iostream>#include<algorithm>#define N 1005using namespace std;int a[N];int bsearch(int *a,int x,int y,int val) { int ...

The SUM problem can be formulated as follows: given four lists A, B, C, D of integer values, compute how many quadruplet (a, b, c, d) ∈ A × B × C × D are such that a + b + c + d = 0. In the following,...

We would like to place n rooks, 1 ≤ n ≤ 5000, on a n × n board subject to the following restrictions• The i-th rook can only be placed within the rectangle given by its left-upper corner (xli , yli)...

Stacks and Queues are often considered the bread and butter of data structures and find use in architecture, parsing, operating systems, and discrete event simulation. Stacks are also important in the...

The United Nations has decided to build a new headquarters in Saint Petersburg, Russia. It will have a form of a rectangular parallelepiped and will consist of several rectangular floors, one on top o...

Emily the entrepreneur has a cool business idea: packaging and selling snowflakes. She has devised a machine that captures snowflakes as they fall, and serializes them into a stream of snowflakes that...