Codeforces Round #757 (Div. 2)

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;



int main() {
	int t, n, l, r, k,a;
	vector<int>v;
	cin >> t;
	while (t--) {
		cin >> n>>l>>r>>k;
		for (int i = 0; i < n; ++i) {
			cin >> a;
			if (a <= r && a >= l) {
				v.push_back(a);
			}
		}
		sort(v.begin(), v.end());
		int i = 0;
		while (i<v.size()&&k >= 0) {
			k -= v[i];
			++i;
		}
		if (k < 0)
			cout << i - 1 << endl;
		else
			cout << i << endl;
		v.clear();
	}
}

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;

struct node {
	int num;
	long long  val;
}a;

bool cmp(node& a, node& b) {
	return a.val > b.val;
}
int main() {
	int t,n;
	vector<node>v;
	cin >> t;
	while (t--) {
		cin >> n;
		for (int i = 0; i < n; ++i) {
			cin >> a.val; a.num = i;
			v.push_back(a);
		}
		sort(v.begin(), v.end(), cmp);
		int* s = new int[n]; int j = 1, k = -1;
		long long sum = 0, z = 0;
		for (int i = 0; i < n; ++i) {
			if (i % 2 == 0)
				s[v[i].num] = j, j += 1,z++;
			else
				s[v[i].num] = k, k -= 1;
//这里！原本sum是longlong,v[i].val , z都是int，会造成算术溢出，结果错误！
			sum =sum+ v[i].val * z;
		}
		cout << sum*2 << endl; cout << 0 << " ";
		for (int i = 0; i < n; ++i)
			cout << s[i] << " ";
		cout << endl;
		v.clear();

	}

}

补题题解自：大佬

#include<iostream>
#include <algorithm>
#include<cmath>
using namespace std;
 
 //快速幂
long long quickPow(long long a, long long b, long long c)
{
	long long tmp = a, ans = 1;
	while (b) {
			//步步取模，一旦遇到与最终结果的计算过程有关的数值都要取模
		if (b & 1)
			ans = ans * tmp % c;
		tmp = tmp * tmp % c;//步步取模
		b >>= 1;
		}
	return ans;
}
int main() {
	long long t, n, m;
	long long l, r, x;
	long long sum = 0;
	cin >> t;
	while (t--) {
		cin >> n >> m;
		for (long long i = 0; i < m; ++i) {
		//由于都是01组成的字符串，奇数个1和偶数个1出现的概率相同，则对于x1..xn中，恰好有一半的子集异或和为1（有奇数个1）。而要找出所有1所在的位，则是由所有x1..xn进行或运算得到。
		//而以1所在的位+后面全0所形成的字符串就是：所有x1..xn从最低位开始到1所在的位的下一位的异或和。所以只要找出所有1所在的位，并且组成的01字符串*一半的子集个数即为最终所求的异或和。
			cin >> l >> r >> x;
			sum |= x;
		}
		//2的n-1次方则为一半的子集个数
		cout << sum * quickPow(2, n - 1, (1000000000 + 7)) % (1000000000 + 7) << endl;
		sum = 0;
	}
}

#include<iostream>
#include <algorithm>
using namespace std;
 
 
long long cnt[5 * 1000000 + 5];
long long dp[5*1000000+5];
int main() {
	int n,a;
	cin >> n;
	for (int i = 1; i <= n; ++i) {
		cin >> a;
		cnt[a]++;
	}
	for (int i = 1; i <= 5e6; ++i) {
		for (int j = 2 * i; j <= 5e6; j += i) {
			cnt[i] += cnt[j];
		}
	}
	dp[1] = n;
	for (int i = 1; i <= 5*1000000; ++i) {
		for (int j = 2 * i; j <= 5*1000000; j += i) {
			dp[j] = max(dp[j], dp[i] + (j - i) * cnt[j]);
		}
	}
	sort(dp + 1, dp + 1 + 5*1000000+1);
	cout << dp[1 + 5 * 1000000] << endl;
}