四川大学第四届新手赛
https://ac.nowcoder.com/acm/contest/34671?&headNav=www#question
B
-
题意:
- 长度为 n 的数组
- 每次查询 T ( l , r , x ) = ∑ i = l r m a x j ∈ [ i , x ] ( a [ j ] ) T(l, r, x) = \sum_{i = l}^r max_{j \in [i, x]}(a[j]) T(l,r,x)=∑i=lrmaxj∈[i,x](a[j])
-
题解:
- 离线 单调栈 线段树
- 将查询按 x 排序
- 线段树的节点 [ l , r ] [l,r] [l,r] 维护 ∑ i = l r m a x j ∈ [ i , x ] ( a [ j ] ) \sum_{i = l}^r max_{j \in [i, x]}(a[j]) ∑i=lrmaxj∈[i,x](a[j])
- 线段树更新:
- 寻找
min
(
i
)
,
a
[
i
]
>
=
a
[
x
]
\min(i), a[i] >= a[x]
min(i),a[i]>=a[x]
- 单调栈维护 i i i
- 区间
[
i
+
1
,
x
]
[i + 1, x]
[i+1,x] 全部更新
- 用 a [ x ] a[x] a[x] 作 tag
- 区间值为 ( r − l + 1 ) ∗ t a g (r - l + 1) * tag (r−l+1)∗tag
- 寻找
min
(
i
)
,
a
[
i
]
>
=
a
[
x
]
\min(i), a[i] >= a[x]
min(i),a[i]>=a[x]
- 离线 单调栈 线段树
// https://ac.nowcoder.com/acm/contest/34671/B
#include <algorithm>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
using T = int;
T rad(); // quick read
const int inf = 0x3f3f3f3f;
#define rf(i, n) for (int i = 1; i <= (n); ++i)
const int max_size = 5 + 2e5;
const int maxn = 5 + 1e6;
int n, m;
int a[maxn];
struct Segtree {
public:
ll val[maxn << 2];
int tag[maxn << 2];
private:
void maintain(int u) { val[u] = val[u << 1] + val[u << 1 | 1]; }
void update_node(int u, int l, int r, ll x) { val[u] = (r - l + 1) * x, tag[u] = x; }
void push_down(int u, int l, int r) {
if (tag[u] == 0) return;
int mid = l + r >> 1;
update_node(u << 1, l, mid, tag[u]);
update_node(u << 1 | 1, mid + 1, r, tag[u]);
tag[u] = 0;
}
public:
void bulid(int u, int l, int r) {
if (l == r) {
val[u] = a[l];
return;
}
int mid = l + r >> 1;
bulid(u << 1, l, mid);
bulid(u << 1 | 1, mid + 1, r);
maintain(u);
}
void update(int u, int l, int r, int s, int t, ll x) {
if (s <= l && r <= t) {
update_node(u, l, r, x);
return;
}
push_down(u, l, r);
int mid = l + r >> 1;
if (s <= mid) update(u << 1, l, mid, s, t, x);
if (t > mid) update(u << 1 | 1, mid + 1, r, s, t, x);
maintain(u);
}
ll ask(int u, int l, int r, int s, int t) {
if (s <= l && r <= t) return val[u];
push_down(u, l, r);
int mid = l + r >> 1;
if (t <= mid) return ask(u << 1, l, mid, s, t);
if (s > mid) return ask(u << 1 | 1, mid + 1, r, s, t);
return ask(u << 1, l, mid, s, t) + ask(u << 1 | 1, mid + 1, r, s, t);
}
} sg;
vector<int> sk;
struct ASK {
int l, r, x;
int id;
ll ans;
bool operator<(const ASK &r) const { return id < r.id; }
} ask[max_size];
bool cmp(const ASK &a, const ASK &b) { return a.x < b.x; }
int sk_maintain(int pos) {
while (sk.size() > 1 && a[pos] >= a[sk.back()])
sk.pop_back();
int ret = sk.back() + 1;
sk.push_back(pos);
return ret;
}
int main() {
n = rad();
rf(i, n) a[i] = rad();
m = rad();
rf(i, m) ask[i].l = rad(), ask[i].r = rad(), ask[i].x = rad(), ask[i].id = i;
sort(ask + 1, ask + 1 + m, cmp);
sk.push_back(0);
rf(i, m) {
for (int pos = sk.back() + 1; pos <= ask[i].x; ++pos) {
int l = sk_maintain(pos);
sg.update(1, 1, n, l, pos, a[pos]);
}
ask[i].ans = sg.ask(1, 1, n, ask[i].l, ask[i].r);
}
sort(ask + 1, ask + 1 + m);
rf(i, m) printf("%lld ", ask[i].ans);
}
T rad() {
T back = 0;
int ch = 0, posi = 0;
for (; ch < '0' || ch > '9'; ch = getchar())
posi = ch ^ '-';
for (; ch >= '0' && ch <= '9'; ch = getchar())
back = (back << 1) + (back << 3) + (ch & 0xf);
return posi ? back : -back;
}
G
-
题意:
- 求 [1, n] 中最大的质数
-
题解:
- 枚举 millerRabin
#include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
using ll = long long;
using T = int;
T rad(); // quick read
const int inf = 0x3f3f3f3f;
#define rf(i, n) for (int i = 1; i <= (n); ++i)
const int max_size = 5 + 100;
const int maxn = 5 + 100;
ll quick_mul(ll a, ll b, ll mod) { // 防溢乘法取模
ll back = 0;
for (; b > 0; a = (a << 1) % mod, b >>= 1)
if (b & 1) back = (back + a) % mod;
return back;
}
ll quick_pow(ll a, ll b, ll mod) { // 快速幂取模
ll back = 1;
for (a %= mod; b > 0; a = quick_mul(a, a, mod), b >>= 1)
if (b & 1) back = quick_mul(back, a, mod);
return back;
}
bool millerRabin(ll n) { // 素数概率性测试
if (n <= 3) return n > 1;
if (n % 2 == 0 || n % 3 == 0) return 0;
ll t = n - 1, k = 0; // n - 1 = t * (2 ^ k)
while (t % 2 == 0)
t /= 2, ++k;
for (int i = 1, ed = 10; i <= ed; ++i) {
ll a = ((ll)rand() * rand()) % (n - 2) + 2; // [2, n - 1]
ll base = quick_pow(a, t, n), last; // a ^ t
for (int j = 0; j < k; ++j) {
last = base;
base = quick_mul(base, base, n);
if (base == 1 && last != 1 && last != n - 1) return 0; // 二次平方探测定理
}
if (base != 1) return 0; // 费马小定理
}
return 1;
}
int main() {
ll n;
cin >> n;
for (ll i = n; i >= 2; --i) {
if (millerRabin(i)) {
cout << i;
break;
}
}
}
T rad() {
T back = 0;
int ch = 0, posi = 0;
for (; ch < '0' || ch > '9'; ch = getchar())
posi = ch ^ '-';
for (; ch >= '0' && ch <= '9'; ch = getchar())
back = (back << 1) + (back << 3) + (ch & 0xf);
return posi ? back : -back;
}
K
训练赛复盘
这次的题目我愿称呼为模拟专场,包含大量的模拟题,如E、F、H、J。
前期,我们队采用了两头开的顺序破题。我的两个队友从头,我从尾。我因为被之前多维容斥原理弄怕了,所以没有看出L题是签到题。但是幸好让队友去看了一眼。看到J题是小模拟后,我当场开敲,准备拿首杀。但是被卡了4个半小时(整数除法不满足结合律)。G题是模板题,但是开晚了(我被J卡了,浪费了时间)。
中期,我们陆陆续续拿下了板子题(G),签到题(E、F、H、L),图论题(K)
后期,我被J卡烂了,所以去看了看B,感觉是离线+维护,和队友一讨论,算法当场清晰明了。但是我线段树很生疏,所以让队友敲了。这导致后面他破M题比较晚,没有机会了。结束之前,我终于反应过来了,把J过了。
总结个人问题
- 开题策略不对,记住模拟题永远放最后
- 破题速度慢,没有在 O(1) 时间找到签到题拿首杀
- 线段树很生疏
- 害怕图论