结构体封装 RE 求助
  • 板块学术版
  • 楼主PikachuQAQ
  • 当前回复7
  • 已保存回复7
  • 发布时间2024/9/17 15:30
  • 上次更新2024/9/17 18:30:40
查看原帖
结构体封装 RE 求助
785796
PikachuQAQ楼主2024/9/17 15:30

非法内存访问

#include <bits/stdc++.h>

using namespace std;

const int kMaxN = 4e5 + 2;

template<typename T> struct Trie_01 {
private: 
    struct F {
        int ch[3], cnt;
    } a[kMaxN * 31];
    int n, tot, mxbit;

public: 
    explicit Trie_01(int wordCnt, int maxBit) { n = wordCnt, mxbit = maxBit; }
	
};

int n, a[kMaxN], pre[kMaxN];
long long ans;

int main() {
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
		pre[i] = pre[i - 1] ^ a[i];
	}
	Trie_01<int> t1(n, 30), t2(n, 30);
	// t1.Insert(0), t2.Insert(0);
	// for (int i = 1; i <= n; i++) t2.Insert(pre[i]);
	// for (int i = 1; i < n; i++) {
	// 	t1.Insert(pre[i]), t2.Delete(pre[i]);
	// 	cout << 1ll * t1.QueryMax(pre[i]) << ' ' << t2.QueryMax(pre[n]) << '\n';
	// 	ans = max(ans, 1ll * t1.QueryMax(pre[i]) + t2.QueryMax(pre[n]));
	// }
	// cout << ans;
	
	return 0;
}
2024/9/17 15:30
加载中...