題目鏈接:http://codeforces.com/problemset/problem/1189/B codepage=1208,AC代碼: #include<bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
int a[maxn];
int b[maxn];
int c[maxn];
bool check(int i)
{if(a[i] &
A. Puzzles 对\(f[]\)排序,取连续的\(m\)个。B. Routine Problem 考虑\(\frac{a}{b}\)和\(\frac{c}{d}\)的大小关系,适配后就是分数的运算。C. Quiz 按\(k\)将\(n\)个问题分段,那么在没有分数翻倍的情况下最大题数为\[(k-1)\lfloor\frac{n}{k}\rfloor