算法竞赛恢复训练
2020/10/30
二进制拆分乘法
Poj1995 [Raising Modulo Numbers]
#include<iostream>
#include<cstring>
#include<string>
#include<cstdio>
using namespace std;
int x, y, z, T, H, ans;
inline int Read() {
int x=0,f=1;char ch=getchar();
while(ch>'9'||ch<'0'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x * f;
}
int power(int a, int b, int p) {
int ans = 1 % p;
for (; b; b>>=1) {
if (b & 1) ans = (long long)ans * a % p;
a = (long long)a * a % p;
}
return ans;
}
int main() {
T = Read();
while(T--) {
z = Read();
H = Read();
ans = 0;
for (int i=1;i<=H;++i) {
x = Read();
y = Read();
ans += power(x, y, z);
}
printf("%d\n", ans % z);
}
return 0;
}
状态的储存:
Poj1958Strange Towers of Hanoi
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
using namespace std;
typedef long long ll;
ll d[20], f[20];
void work() {
memset(f, 0x3f, sizeof(f));
d[1] = 1;f[1] = 1;
for (int i=1;i<=12;++i) d[i] = 2 * d[i - 1] + 1;//对于i个盘子,可以将i-1个盘子放到除目标杆子的另一个杆子上,然后将第i个盘子放到目标盘子上,之后将剩下的盘子重新放目标盘子上
for (int i=1;i<=12;++i) {
for (int j=1;j<i;++j) {
f[i]= min(f[i], f[j] * 2 + d[i - j]); //j个盘子已经站住了四根杆子里的一根,所以剩下的i-j个盘子就是三个杆子移动的情况
}
}
}
int main() {
work();
for (int i=1;i<=12;++i) {
printf("%ld\n", f[i]);
}
return 0;
}
二位前缀和
luoguP2280[HNOI2003]激光炸弹
#include<bits/stdc++.h>
using namespace std;
int n, m, ans = -1;
int s[5010][5010];
inline int Read() {
int x=0,f=1;char ch=getchar();
while(ch>'9'||ch<'0'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x * f;
}
inline void init() {
n = Read();m = Read();
int x, y, v;
for (int i=1;i<=n;++i) {
x = Read(); y = Read(); v = Read();
s[x + 1][y + 1] += v;
}
for (int i=1;i<=5001;++i) {
for (int j=1;j<=5001;++j) {
s[i][j] += s[i - 1][j] + s[i][j - 1] - s[i - 1][j - 1];//进行二位前缀和的计算,利用了容错原理
}
}
}
void work() {
for (int i=m;i<=5001;++i) {
for (int j=m;j<=5001;++j) {
ans = max(ans, s[i][j] - s[i][j-m] - s[i-m][j] + s[i-m][j-m]);//取出所有边长为m的正方形的值
}
}
}
int main() {
init();
work();
cout << ans;
return 0;
}
一维前缀和的基本应用
POJ3263 Tallest Cow
#include<bits/stdc++.h>
//#include<cstring>
//#include<map>
//#include<utility>
//#include<cstdio>
//#include<cstring>
//#include<iostream>
using namespace std;
const int maxn = 10010;
int n, m, p, h;
int c[maxn], d[maxn];
map<pair<int, int>, bool> e; //来判断一对关系是否已经操作过了
inline int Read() {
int x=0,f=1;char ch=getchar();
while(ch>'9'||ch<'0'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x * f;
}
void work() {
n = Read(); p = Read(); h = Read(); m = Read();
int a, b;
for (int i=1;i<=m;++i) {
a = Read(); b = Read();
if (a > b) swap(a, b);//来保证数对的唯一性
if (e[make_pair(a, b)]) continue;
d[a + 1]--; d[b]++;//对前缀数组进行编辑
e[make_pair(a, b)] = true;
}
for (int i=1;i<=n;++i) {
c[i] += c[i - 1] + d[i];//将数组还原
printf("%d\n", c[i] + h);
}
cout << endl;
}
int main() {
work();
return 0;
}
2020/10/31
练习:对于n个数进行组合(递归枚举)
/*
这样实现的是一个组合的枚举,是n个数任意多个数的随机组合。
*/
#include<bits/stdc++.h>
using namespace std;
vector<int> chosen;
int n;
void calc(int x) {
//if (chosen.size() > m || chosen.size() + n - x + 1 < m) return; 一句话变成m个数字的组合
if (x == n + 1) {
for (int i=0;i<chosen.size();++i)
printf("%d ", chosen[i]);
puts("");
return;
}//边界条件
calc(x + 1);//不选择第x个数进行下一层
chosen.push_back(x);//选择第x个数进行下一层
calc(x + 1);
chosen.pop_back();//回溯
}
int main() {
cin >> n;
//cin >> m;
calc(1);
return 0;
}
2020/11/1
例题:对于n个数进行排列(递归枚举)
#include<bits/stdc++.h>
using namespace std;
int order[40];
bool chosen[40];
int n;
void calc(int x) {
if (x == n + 1) {
for (int i=1;i<=n;++i) printf("%d ", order[i]);
puts("");
return;
}
for (int i=1;i<=n;++i) {
if (chosen[i]) continue;
order[x] = i;
chosen[i] = 1;
calc(x + 1);
chosen[i] = 0;
}
}
int main() {
cin >> n;
calc(1);
return 0;
}