当前位置：首页 > wzjs >正文

创建网站建设手机端开发网站模板下载

wzjs 2025/9/4 22:56:01

创建网站建设,手机端开发网站模板下载,小程序制作软件下载,数据库作业代做网站负一、写在前面本文针对Golang实现C版本可见另一册Github仓库零、前置一、基础算法 0. 内容概要包括排序、二分、前缀和、差分、双指针、离散化、区间和 1. 排序 （1）快速排序 package mainimport "fmt"func QuickSort(arr []int, …

负一、写在前面

本文针对Golang实现
C++版本可见另一册
Github仓库

零、前置

一、基础算法

0. 内容概要

包括排序、二分、前缀和、差分、双指针、离散化、区间和

1. 排序

（1）快速排序

package mainimport "fmt"func QuickSort(arr []int, l int, r int) {if l >= r {return}x, i, j := arr[(l+r)/2], l-1, r+1for i < j {for {i++if arr[i] >= x {break}}for {j--if arr[j] <= x {break}}if i < j {arr[i], arr[j] = arr[j], arr[i]}}QuickSort(arr, l, j)QuickSort(arr, j+1, r)
}func main() {var n intfmt.Scanln(&n)arr := make([]int, n+5)for i := 0; i < n; i++ {fmt.Scan(&arr[i])}QuickSort(arr, 0, n-1)for i := 0; i < n; i++ {fmt.Printf("%d ", arr[i])}
}

（2）归并排序

package mainimport "fmt"// https://www.acwing.com/problem/content/789/func MergeSort(arr []int, l int, r int) {if l >= r {return}mid := (l + r) / 2MergeSort(arr, l, mid)MergeSort(arr, mid+1, r)tmp := make([]int, r-l+1)i, j, k := l, mid+1, 0for i <= mid && j <= r {if arr[i] < arr[j] {tmp[k] = arr[i]k++i++} else {tmp[k] = arr[j]k++j++}}for i <= mid {tmp[k] = arr[i]k++i++}for j <= r {tmp[k] = arr[j]k++j++}k = 0for i := l; i <= r; i++ {arr[i] = tmp[k]k++}
}func main() {var n intfmt.Scanln(&n)arr := make([]int, n+5)for i := 0; i < n; i++ {fmt.Scan(&arr[i])}MergeSort(arr, 0, n-1)for i := 0; i < n; i++ {fmt.Printf("%d ", arr[i])}
}

2. 二分

（1）整数二分

package mainimport "fmt"// https://www.acwing.com/problem/content/791/
func main() {var n, q intfmt.Scanf("%d %d", &n, &q)arr := make([]int, n+5)for i := 0; i < n; i++ {fmt.Scan(&arr[i])}var x intfor q > 0 {fmt.Scanln(&x)l, r := 0, n-1for l < r {mid := (l + r) / 2if arr[mid] < x {l = mid + 1} else {r = mid}}q--if arr[l] != x {fmt.Println("-1 -1")continue}fmt.Print(l)l, r = 0, n-1for l < r {mid := (l + r + 1) / 2if arr[mid] > x {r = mid - 1} else {l = mid}}fmt.Printf(" %d\n", l)}
}

（2）浮点数二分

package mainimport "fmt"// https://www.acwing.com/problem/content/792/
func main() {var n float64fmt.Scanln(&n)l, r := -1000.00, 1000.00for r-l > 1e-7 {mid := (l + r) / 2if mid*mid*mid > n {r = mid} else {l = mid}}fmt.Printf("%.6f", l)
}

3. 前缀和

（1）一维前缀和

package mainimport "fmt"// https://www.acwing.com/problem/content/797/
func main() {var n, m intfmt.Scanf("%d %d", &n, &m)a := make([]int, n+5)sa := make([]int, n+5)for i := 1; i <= n; i++ {fmt.Scan(&a[i])sa[i] = sa[i-1] + a[i]}var l, r intfor m > 0 {fmt.Scanf("%d %d", &l, &r)fmt.Println(sa[r] - sa[l-1])m--}
}

（2）二维前缀和

package mainimport ("bufio""fmt""os"
)// https://www.acwing.com/problem/content/description/798/
func main() {in := bufio.NewReader(os.Stdin)out := bufio.NewWriter(os.Stdout)defer out.Flush()var n, m, q intfmt.Scanf("%d %d %d", &n, &m, &q)a := make([][]int, n+1)sa := make([][]int, n+1)for i := 0; i <= n; i++ {a[i] = make([]int, m+1)sa[i] = make([]int, m+1)}for i := 1; i <= n; i++ {for j := 1; j <= m; j++ {fmt.Fscan(in, &a[i][j])sa[i][j] = sa[i-1][j] + sa[i][j-1] - sa[i-1][j-1] + a[i][j]}}var x1, y1, x2, y2 intfor q > 0 {fmt.Fscan(in, &x1, &y1, &x2, &y2)fmt.Fprintln(out, sa[x2][y2]-sa[x2][y1-1]-sa[x1-1][y2]+sa[x1-1][y1-1])q--}
}

4. 差分

（1）一维差分

package mainimport ("bufio""fmt""os"
)// https://www.acwing.com/problem/content/799/func main() {in := bufio.NewReader(os.Stdin)//out := bufio.NewWriter(os.Stdout)var n, q intfmt.Scan(&n, &q)a := make([]int, n+5)sa := make([]int, n+5)for i := 1; i <= n; i++ {fmt.Fscan(in, &a[i])sa[i] += a[i]sa[i+1] -= a[i]}var l, r, c intfor q > 0 {fmt.Fscan(in, &l, &r, &c)sa[l] += csa[r+1] -= cq--}for i := 1; i <= n; i++ {sa[i] += sa[i-1]fmt.Printf("%d ", sa[i])}}

（2）二维差分

package mainimport ("bufio""fmt""os"
)// https://www.acwing.com/problem/content/description/800/
func insert(a [][]int, x1, y1, x2, y2, c int) {a[x1][y1] += ca[x2+1][y1] -= ca[x1][y2+1] -= ca[x2+1][y2+1] += c
}func main() {in := bufio.NewReader(os.Stdin)var n, m, q intfmt.Scan(&n, &m, &q)a := make([][]int, n+2)for i := 0; i <= n+1; i++ {a[i] = make([]int, m+2)}var x intfor i := 1; i <= n; i++ {for j := 1; j <= m; j++ {fmt.Fscan(in, &x)insert(a, i, j, i, j, x)}}var x1, y1, x2, y2 intfor q > 0 {fmt.Fscan(in, &x1, &y1, &x2, &y2, &x)insert(a, x1, y1, x2, y2, x)q--}for i := 1; i <= n; i++ {for j := 1; j <= m; j++ {a[i][j] += a[i-1][j] + a[i][j-1] - a[i-1][j-1]}}for i := 1; i <= n; i++ {for j := 1; j <= m; j++ {fmt.Printf("%d ", a[i][j])}fmt.Println()}}

5. 合并区间

package mainimport ("bufio""fmt""os""sort"
)//https://www.acwing.com/problem/content/description/805/type seg struct {l intr int
}func main() {in := bufio.NewReader(os.Stdin)out := bufio.NewWriter(os.Stdout)defer out.Flush()var n intfmt.Fscan(in, &n)a := make([]seg, n)for i := 0; i < n; i++ {fmt.Fscan(in, &a[i].l, &a[i].r)}sort.Slice(a,func(i, j int) bool {return a[i].l <= a[j].l})ans := 0st, ed := a[0].l, a[0].rfor i := 1; i < n; i++ {now := a[i]if ed < now.l {ans++st = now.led = now.r} else {st = stif ed < now.r {ed = now.r}}}fmt.Println(ans + 1)
}