目录
1.第k个数
给定一个长度为n的整数数列,以及一个整数k,请用快速选择算法求出数列的第k小的数是多少。
输入:
5 3
2 4 1 5 3
输出:
3
#include <iostream>
using namespace std;
const int N = 100010;
int n, k;
int a[N];
int quick_sort(int l, int r, int k)
{
if(l == r) return a[l];
int x = a[l], i = l - 1, j = r + 1;
while(i < j)
{
do i ++ ; while(a[i] < x);
do j -- ; while(a[j] > x);
if (i < j) swap(a[i], a[j]);
}
int sl = j - l + 1;
if (k <= sl) return quick_sort(l, j, k);
return quick_sort(j + 1, r, k - sl);
}
int main()
{
cin >> n >> k;
for(int i = 0; i < n; i ++) cin >> a[i];
cout << quick_sort(0, n - 1, k) << endl;
return 0;
}
2.逆序对的数量
归并排序流程:
① [L, R] = > [L, mid] [mid + 1, R]
②递归排序[L, mid] 和 [mid + 1, R]
③归并,将左右两个有序序列合并成一个有序序列
例题:输入第一行n 表示数列的长度 第二行包含n个整数,表示整个数列
输出一个整数 表示逆序对的个数 要求数据范围 1 <= n <= 100000
样例 输入 6 输出 5
2 3 4 5 6 1
#include <iostream>
using namespace std;
typedef long long LL;
const int N = 100010;
int n;
int q[N], tmp[N];
LL merge_sort(int l, int r)
{
if(l >= r) return 0;
int mid = l + r >> 1;
LL res = merge_sort(l, mid) + merge_sort(mid + 1, r);
// 归并过程
int k = 0, i = l, j = mid + 1;
while (i <= mid && j <= r)
if(q[i] <= q[j]) tmp[k++] = q[i++];
else
{
tmp[k++] = q[j++];
res += mid - i + 1;
}
// 扫尾
while(i <= mid) tmp[k++] = q[i++];
while(j <= r) tmp[k++] = q[j++];
// 物归原主
for(int i = l, j = 0; i <= r; i++, j++) q[i] = tmp[j];
return res;
}
int main()
{
cin >> n;
for (int i = 0; i < n; i ++) cin >> q[i];
cout << merge_sort(0, n - 1) << endl;
return 0;
}
3.数的三次方跟
#include <iostream>
using namespace std;
int main()
{
double x;
cin >> x;
double l = -10000, r = 10000;
while(r - l > 1e-8)
{
double mid = (l + r) / 2;
if(mid * mid * mid >= x) r = mid;
else l = mid;
}
printf("%lf\n", l);
return 0;
}
4.前缀和
(1)一维前缀和:
1.Si = a1 + a2 + ... + ai
2.sum(L,R) = aL + aL+1 + aL+2 + ... + aR = Sr - Sl-1
输入第一行包含两个整数n和m,第二行包含n个整数,接下来m行每行包含两个整数l和r表示一个范围
输出共m行,每行输出询问的结果 (求和)
#include <iostream>
using namespace std;
const int N =100010;
int n,m;
int a[N],s[N];
int main()
{
cin >> n >> m;
for(int i = 1; i <= n; i ++) cin >> a[i];
// 求前缀和数组
for(int i = 1; i <= n; i ++) s[i] = s[i-1] + a[i];
while(m --)
{
int l,r;
cin >> l >> r;
cout << s[r] - s[l-1] << endl;
}
return 0;
}
(2)二维前缀和:
输入一个n行m列的整数矩阵,再输入q个询问,每个询问包含四个整数x1,y1,x2, y2,表示一个子矩阵的左上角坐标和右下角坐标。
对于每个询问输出子矩阵中所有数的和。
#include <iostream>
using namespace std;
const int N = 1010;
int n, m, q;
int a[N][N],s[N][N];
int main()
{
cin >> n >> m >> q;
int i, j;
for(i = 1; i <= n; i ++)
for(j = 1; j <= m; j ++)
cin >> a[i][j];
for(i = 1; i <= n; i ++)
for(j = 1; j <= m; j ++)
s[i][j] = s[i - 1][j] + s[i][j - 1] - s[i - 1][j - 1] + a[i][j];
while(q --)
{
int x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
cout << s[x2][y2] - s[x1 - 1][y2] - s[x2][y1 - 1] + s[x1 - 1][y1 - 1] << endl;
}
return 0;
}
5.差分
(1)一维差分
给定数组 给l~r序列数组加上c
#include <iostream>
using namespace std;
const int N = 100010;
int n, m;
int a[N], b[N];
void insert(int l, int r, int c)
{
b[l] += c;
b[r + 1] -= c;
}
int main()
{
scanf("%d%d", &n, &m);
for(int i = 1; i <= n; i ++) cin >> a[i];
for(int i = 1; i <= n; i ++) insert(i, i, a[i]);
while(m --)
{
int l, r, c;
cin >> l >> r >> c;
insert(l, r, c);
}
for(int i = 1; i <= n; i ++) a[i] = a[i-1] + b[i];
for(int i = 1; i <= n; i ++) cout << a[i] << " " ;
return 0;
}
(2)二维差分
例题:给二维数组中 x1,y1 到 x2 , y2 的元素加上c 输出操作后的数组
#include <iostream>
using namespace std;
const int N = 1010;
int n, m, q;
int a[N][N], b[N][N];
void insert(int x1, int y1, int x2, int y2, int c)
{
b[x1][y1] += c;
b[x2 + 1][y1] -= c;
b[x1][y2 + 1] -= c;
b[x2 + 1][y2 + 1] += c;
}
int main()
{
scanf("%d%d%d", &n, &m, &q);
for(int i = 1; i <= n; i ++)
for(int j = 1; j <= m; j ++)
scanf("%d", &a[i][j]);
for(int i = 1; i <= n; i ++)
for(int j = 1; j <= m; j ++)
insert(i,j,i,j,a[i][j]);
while( q --)
{
int x1, y1, x2, y2, c;
scanf("%d%d%d%d%d", &x1, &y1, &x2, &y2, &c);
insert(x1, y1, x2, y2, c);
}
for(int i = 1; i <= n; i ++)
for(int j = 1; j <= m; j ++)
a[i][j] = a[i][j - 1] + a[i - 1][j] - a[i - 1][j - 1] + b[i][j];
for(int i = 1; i <= n; i ++)
{
for(int j = 1; j <= m; j ++)
cout << a[i][j] << " ";
cout << endl;
}
return 0;
}