地址:http://codeforces.com/contest/1110
过了点时间做这些题,脑子都慢了,三四千人过的题,我都不怎么会
B题解析:给定一个数列b,在数列b上分割成k(k <= K)部分,k部分的长度(每一段右端点 - 左端点 - 1)的加和最小。
刚开始一直怎么贪心取区间长度小的,但是反过来想一想,找区间长度可能不现实,因为最大也就是b[n] - b[1] + 1,就找间隔大的地方那里切一刀,相当于在那里分割开,找前k个(k <= K)大的间隔切割即可
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int inf = 0x3f3f3f3f;
#define mp make_pair
#define pb push_back
#define fi first
#define se second
const int N = 100005;
int b[N];
int main()
{
int n,m,k;
cin >> n >> m >> k;
for(int i = 0;i < n;++i){
cin >> b[i];
}
vector<int>ve;
for(int i = 1;i < n;++i){
ve.pb(b[i] - b[i - 1] - 1);
}
sort(ve.begin(),ve.end());
int ans = b[n - 1] - b[0] + 1;
//cout << ans << endl;
int len = ve.size();
for(int i = len - 1;i >= len - k + 1;--i){
ans -= ve[i];
//cout << ve[i] << endl;
}
cout << ans << endl;
return 0;
}
C题解析:原本以为不是1就是m按位取反后与n的异或值,但是不是这样的,有特殊情况,就是2^i - 1,遇到这种类似数论的题,应该打一下表,果然,一打表全都看出来了。
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int inf = 0x3f3f3f3f;
#define mp make_pair
#define pb push_back
#define fi first
#define se second
int a[] = {1,1,5,1,21,1,85,73,341,89,1365,1,5461,4681,21845,1,87381,1,349525,299593,1398101,178481,5592405,1082401};
int b[] = {3,7,15,31,63,127,255,511,1023,2047,4095,8191,16383,32767,65535,131071,262143,524287,1048575,2097151,4194303,8388607,16777215,33554431};
int main()
{
int q;
cin >> q;
for(int i = 0;i < q;++i){
int m;
cin >> m;
int ans = -1;
int ptr = -1;
for(int i = 0;i < 25;++i){
if(b[i] == m) ans = i;
if(b[i] > m){
ptr = i;
break;
}
}
if(ans == -1){
cout << b[ptr] << endl;
}else{
cout << a[ans] << endl;
}
}
return 0;
}