Nothing else, I just want to remember those functions by myself
1>floyd+bitset optimization
#include
#include #include
using namespace std;
int n;
const int N=2003;
char s
Category: Data Structure
Data structure is the way a computer stores and organizes data. Data structure refers to a collection of data elements that have one or more specific relationships with each other. Under normal circumstances, a carefully selected data structure can bring higher operating or storage efficiency. Data structure is often related to efficient retrieval algorithms and indexing techniques.
[Data Structure] – Time Complexity and Space Complexity
Before reading this article, it is recommended that you first read [Data Structure]-Macro Understanding, and have a Macro understanding. We usetime complexity and space complexity to analyze the al
[Data Structure] Tree and Binary Tree
Tree
Tree is a typical nonlinear data structure, It can be well applied to data collections that describe branching and hierarchical characteristics. It is a limited collection T composed of
[Data Structure] Pile-based priority queue
#include #include #include#include using namespace std ;templatestruct Big{ bool operator()(const T& l,const T& r) {return l>r; }};templatestruct Less{ bool operator()(const T& l,const T& r) {retur
[Data Structure] Bubble Sort
Compare adjacent elements. If the first one is bigger than the second one, swap the two of them. Do the same work for each pair of adjacent elements, from the first pair at the beginning to the l
[Data Structure] Closing of the binary tree
The node structure of the binary tree is now redefined as follows: leftchild lefttag _date righttag rightchild where: when lefttag=0, leftchild points to the left child;
[Data Structure] CODE [VS] 2491 && Bzoj 3039 Jade Palace (single monoton)
Click to watch
Click to watch
The meaning of the question is to ask you to find the maximum submatrix sum
is the two-dimensional expansion of the maximum subsection sum
When doing it, yo
“Data Structure” Experiment 1: Flexible Using the VC Programming Tool
. Experimental content 1. Design a program with a single file structure to input two numbers from the keyboard and output the results of the “sum” and “product” of the two. The requirements are as
RW_ “Data Structure” 9-10 chapter [internal sort and lookup]
2016.09.03 –09.07
[Personal notes, there may be errors]
The notes about sorting or searching [this time Also]:
[1] Re-set search and sorting
[2] Implementation of internal sorting algori
[Data Structure] File Compression Project
Project name: File compression
Development environment: vs2010
Data structure used:
1, heap
2, huffmantree Huffman tree
3, Huffmancode Huffman coding
4, object-o