比赛链接：http://codeforces.com/gym/101028/

由于实习，几乎没有时间刷题了。今天下午得空，断断续续做了这一套题，挺简单的。

A.读完题就能出结果。

 /*

 ━━━━━┒ギリギリ♂ eye！

 ┓┏┓┏┓┃キリキリ♂ mind！

 ┛┗┛┗┛┃＼○／

 ┓┏┓┏┓┃ /

 ┛┗┛┗┛┃ノ)

 ┓┏┓┏┓┃

 ┛┗┛┗┛┃

 ┓┏┓┏┓┃

 ┛┗┛┗┛┃

 ┓┏┓┏┓┃

 ┛┗┛┗┛┃

 ┓┏┓┏┓┃

 ┃┃┃┃┃┃

 ┻┻┻┻┻┻

 */

 #include <algorithm>

 #include <iostream>

 #include <iomanip>

 #include <cstring>

 #include <climits>

 #include <complex>

 #include <cassert>

 #include <cstdio>

 #include <bitset>

 #include <vector>

 #include <deque>

 #include <queue>

 #include <stack>

 #include <ctime>

 #include <set>

 #include <map>

 #include <cmath>

 using namespace std;

 #define fr first

 #define sc second

 #define cl clear

 #define BUG puts("here!!!")

 #define W(a) while(a--)

 #define pb(a) push_back(a)

 #define Rint(a) scanf("%d", &a)

 #define Rll(a) scanf("%I64d", &a)

 #define Rs(a) scanf("%s", a)

 #define Cin(a) cin >> a

 #define FRead() freopen("in", "r", stdin)

 #define FWrite() freopen("out", "w", stdout)

 #define Rep(i, len) for(LL i = 0; i < (len); i++)

 #define For(i, a, len) for(LL i = (a); i < (len); i++)

 #define Cls(a) memset((a), 0, sizeof(a))

 #define Clr(a, w) memset((a), (w), sizeof(a))

 #define Fuint(a) memset((a), 0x7f7f, sizeof(a))

 #define lrt rt << 1

 #define rrt rt << 1 | 1

 #define pi 3.14159265359

 #define RT return

 #define lowbit(w) w & (-w)

 #define onenum(w) __builtin_popcount(w)

 typedef long long LL;

 typedef long double LD;

 typedef unsigned long long Uint;

 typedef pair<LL, LL> pii;

 typedef pair<string, LL> psi;

 typedef map<string, LL> msi;

 typedef vector<LL> vi;

 typedef vector<LL> vl;

 typedef vector<vl> vvl;

 typedef vector<bool> vb;

 const int maxn = ;

 int n;

 int x;

 int rk;

 int main() {

     // FRead();

     int T;

     Rint(T);

     W(T) {

         Rint(n); Rint(rk);

         int cur = ;

         W(n) {

             Rint(x);

             cur += x;

         }

         if(cur == rk) cout << "Correct" << endl;

         else cout << "Bug" << endl;

     }

     RT ;

 }

A

B.读完提就能出结果。

 /*

 ━━━━━┒ギリギリ♂ eye！

 ┓┏┓┏┓┃キリキリ♂ mind！

 ┛┗┛┗┛┃＼○／

 ┓┏┓┏┓┃ /

 ┛┗┛┗┛┃ノ)

 ┓┏┓┏┓┃

 ┛┗┛┗┛┃

 ┓┏┓┏┓┃

 ┛┗┛┗┛┃

 ┓┏┓┏┓┃

 ┛┗┛┗┛┃

 ┓┏┓┏┓┃

 ┃┃┃┃┃┃

 ┻┻┻┻┻┻

 */

 #include <algorithm>

 #include <iostream>

 #include <iomanip>

 #include <cstring>

 #include <climits>

 #include <complex>

 #include <cassert>

 #include <cstdio>

 #include <bitset>

 #include <vector>

 #include <deque>

 #include <queue>

 #include <stack>

 #include <ctime>

 #include <set>

 #include <map>

 #include <cmath>

 using namespace std;

 #define fr first

 #define sc second

 #define cl clear

 #define BUG puts("here!!!")

 #define W(a) while(a--)

 #define pb(a) push_back(a)

 #define Rint(a) scanf("%d", &a)

 #define Rll(a) scanf("%I64d", &a)

 #define Rs(a) scanf("%s", a)

 #define Cin(a) cin >> a

 #define FRead() freopen("in", "r", stdin)

 #define FWrite() freopen("out", "w", stdout)

 #define Rep(i, len) for(LL i = 0; i < (len); i++)

 #define For(i, a, len) for(LL i = (a); i < (len); i++)

 #define Cls(a) memset((a), 0, sizeof(a))

 #define Clr(a, w) memset((a), (w), sizeof(a))

 #define Fuint(a) memset((a), 0x7f7f, sizeof(a))

 #define lrt rt << 1

 #define rrt rt << 1 | 1

 #define pi 3.14159265359

 #define RT return

 #define lowbit(w) w & (-w)

 #define onenum(w) __builtin_popcount(w)

 typedef long long LL;

 typedef long double LD;

 typedef unsigned long long Uint;

 typedef pair<LL, LL> pii;

 typedef pair<string, LL> psi;

 typedef map<string, LL> msi;

 typedef vector<LL> vi;

 typedef vector<LL> vl;

 typedef vector<vl> vvl;

 typedef vector<bool> vb;

 const int maxn = ;

 char a[maxn], b[maxn];

 int main() {

     // FRead();

     int T;

     Rint(T);

     W(T) {

         Rs(a); Rs(b);

         for(int i = ; a[i]; i++) {

             if(a[i] >= 'A' && a[i] <= 'Z') a[i] = a[i] - 'A' + 'a';

             if(a[i] == 'p') a[i] = 'b';

             else if(a[i] == 'i') a[i] = 'e';

         }

         for(int i = ; b[i]; i++) {

             if(b[i] >= 'A' && b[i] <= 'Z') b[i] = b[i] - 'A' + 'a';

             if(b[i] == 'p') b[i] = 'b';

             else if(b[i] == 'i') b[i] = 'e';

         }

         if(strcmp(a, b) == ) cout << "Yes" << endl;

         else cout << "No" << endl;

     }

     RT ;

 }

B

C.已知式子A|C=B，给你A和B，求C的可能的数量。可以利用或的性质求解，讨论A和B中某位都是1时，C中这一位可以是0也可以是1。注意特判无解情况：AB中某位组合为1 0的情况。

 /*

 ━━━━━┒ギリギリ♂ eye！

 ┓┏┓┏┓┃キリキリ♂ mind！

 ┛┗┛┗┛┃＼○／

 ┓┏┓┏┓┃ /

 ┛┗┛┗┛┃ノ)

 ┓┏┓┏┓┃

 ┛┗┛┗┛┃

 ┓┏┓┏┓┃

 ┛┗┛┗┛┃

 ┓┏┓┏┓┃

 ┛┗┛┗┛┃

 ┓┏┓┏┓┃

 ┃┃┃┃┃┃

 ┻┻┻┻┻┻

 */

 #include <algorithm>

 #include <iostream>

 #include <iomanip>

 #include <cstring>

 #include <climits>

 #include <complex>

 #include <cassert>

 #include <cstdio>

 #include <bitset>

 #include <vector>

 #include <deque>

 #include <queue>

 #include <stack>

 #include <ctime>

 #include <set>

 #include <map>

 #include <cmath>

 using namespace std;

 #define fr first

 #define sc second

 #define cl clear

 #define BUG puts("here!!!")

 #define W(a) while(a--)

 #define pb(a) push_back(a)

 #define Rint(a) scanf("%d", &a)

 #define Rll(a) scanf("%I64d", &a)

 #define Rs(a) scanf("%s", a)

 #define Cin(a) cin >> a

 #define FRead() freopen("in", "r", stdin)

 #define FWrite() freopen("out", "w", stdout)

 #define Rep(i, len) for(LL i = 0; i < (len); i++)

 #define For(i, a, len) for(LL i = (a); i < (len); i++)

 #define Cls(a) memset((a), 0, sizeof(a))

 #define Clr(a, x) memset((a), (x), sizeof(a))

 #define Fuint(a) memset((a), 0x7f7f, sizeof(a))

 #define lrt rt << 1

 #define rrt rt << 1 | 1

 #define pi 3.14159265359

 #define RT return

 #define lowbit(x) x & (-x)

 #define onenum(x) __builtin_popcount(x)

 typedef long long LL;

 typedef long double LD;

 typedef unsigned long long Uint;

 typedef pair<LL, LL> pii;

 typedef pair<string, LL> psi;

 typedef map<string, LL> msi;

 typedef vector<LL> vi;

 typedef vector<LL> vl;

 typedef vector<vl> vvl;

 typedef vector<bool> vb;

 const int maxn = ;

 const LL mod = ;

 int n;

 LL ret;

 char a[maxn], b[maxn];

 int main() {

 //    FRead();

     int T;

     Rint(T);

     W(T) {

         Rint(n);

         ret = ;

         Rs(a); Rs(b);

         bool exflag = ;

         Rep(i, n) {

             if(a[i] == '' && b[i] == '') exflag = ;

         }

         if(exflag == ) {

             cout << "IMPOSSIBLE" << endl;

             continue;

         }

         Rep(i, n) {

             if(a[i] == '' && b[i] == '') ret = (ret * ) % mod;

         }

         cout << ret << endl;

     }

     RT ;

 }

C

D.模拟，数据很小随便写就行了。

 /*

 ━━━━━┒ギリギリ♂ eye！

 ┓┏┓┏┓┃キリキリ♂ mind！

 ┛┗┛┗┛┃＼○／

 ┓┏┓┏┓┃ /

 ┛┗┛┗┛┃ノ)

 ┓┏┓┏┓┃

 ┛┗┛┗┛┃

 ┓┏┓┏┓┃

 ┛┗┛┗┛┃

 ┓┏┓┏┓┃

 ┛┗┛┗┛┃

 ┓┏┓┏┓┃

 ┃┃┃┃┃┃

 ┻┻┻┻┻┻

 */

 #include <algorithm>

 #include <iostream>

 #include <iomanip>

 #include <cstring>

 #include <climits>

 #include <complex>

 #include <cassert>

 #include <cstdio>

 #include <bitset>

 #include <vector>

 #include <deque>

 #include <queue>

 #include <stack>

 #include <ctime>

 #include <set>

 #include <map>

 #include <cmath>

 using namespace std;

 #define fr first

 #define sc second

 #define cl clear

 #define BUG puts("here!!!")

 #define W(a) while(a--)

 #define pb(a) push_back(a)

 #define Rint(a) scanf("%d", &a)

 #define Rll(a) scanf("%I64d", &a)

 #define Rs(a) scanf("%s", a)

 #define Cin(a) cin >> a

 #define FRead() freopen("in", "r", stdin)

 #define FWrite() freopen("out", "w", stdout)

 #define Rep(i, len) for(LL i = 0; i < (len); i++)

 #define For(i, a, len) for(LL i = (a); i < (len); i++)

 #define Cls(a) memset((a), 0, sizeof(a))

 #define Clr(a, x) memset((a), (x), sizeof(a))

 #define Fuint(a) memset((a), 0x7f7f, sizeof(a))

 #define lrt rt << 1

 #define rrt rt << 1 | 1

 #define pi 3.14159265359

 #define RT return

 #define lowbit(x) x & (-x)

 #define onenum(x) __builtin_popcount(x)

 typedef long long LL;

 typedef long double LD;

 typedef unsigned long long Uint;

 typedef pair<LL, LL> pii;

 typedef pair<string, LL> psi;

 typedef map<string, LL> msi;

 typedef vector<LL> vi;

 typedef vector<LL> vl;

 typedef vector<vl> vvl;

 typedef vector<bool> vb;

 const int maxn = ;

 char G[maxn][maxn];

 int n, m, q;

 int a, b, c, d;

 char s[];

 int main() {

 //    FRead();

     int T;

     Rint(T);

     W(T) {

         scanf("%d%d%d",&n,&m,&q);

         Cls(G);

         For(i, , n+)For(j, , m+) G[i][j] = '.';

         W(q) {

             scanf("%d%d%d%d%s",&a,&b,&c,&d,s);

             For(i, a, c+) For(j, b, d+) G[i][j] = s[];

         }

         For(i, , n+) {

             For(j, , m+) {

                 printf("%c", G[i][j]);

             }

             printf("\n");

         }

     }

     RT ;

 }

D

E.看样例秒懂，取所有数的GCD，然后把所有数与GCD的商加起来就行了。

 /*

 ━━━━━┒ギリギリ♂ eye！

 ┓┏┓┏┓┃キリキリ♂ mind！

 ┛┗┛┗┛┃＼○／

 ┓┏┓┏┓┃ /

 ┛┗┛┗┛┃ノ)

 ┓┏┓┏┓┃

 ┛┗┛┗┛┃

 ┓┏┓┏┓┃

 ┛┗┛┗┛┃

 ┓┏┓┏┓┃

 ┛┗┛┗┛┃

 ┓┏┓┏┓┃

 ┃┃┃┃┃┃

 ┻┻┻┻┻┻

 */

 #include <algorithm>

 #include <iostream>

 #include <iomanip>

 #include <cstring>

 #include <climits>

 #include <complex>

 #include <cassert>

 #include <cstdio>

 #include <bitset>

 #include <vector>

 #include <deque>

 #include <queue>

 #include <stack>

 #include <ctime>

 #include <set>

 #include <map>

 #include <cmath>

 using namespace std;

 #define fr first

 #define sc second

 #define cl clear

 #define BUG puts("here!!!")

 #define W(a) while(a--)

 #define pb(a) push_back(a)

 #define Rint(a) scanf("%d", &a)

 #define Rll(a) scanf("%I64d", &a)

 #define Rs(a) scanf("%s", a)

 #define Cin(a) cin >> a

 #define FRead() freopen("in", "r", stdin)

 #define FWrite() freopen("out", "w", stdout)

 #define Rep(i, len) for(LL i = 0; i < (len); i++)

 #define For(i, a, len) for(LL i = (a); i < (len); i++)

 #define Cls(a) memset((a), 0, sizeof(a))

 #define Clr(a, x) memset((a), (x), sizeof(a))

 #define Fuint(a) memset((a), 0x7f7f, sizeof(a))

 #define lrt rt << 1

 #define rrt rt << 1 | 1

 #define pi 3.14159265359

 #define RT return

 #define lowbit(x) x & (-x)

 #define onenum(x) __builtin_popcount(x)

 typedef long long LL;

 typedef long double LD;

 typedef unsigned long long Uint;

 typedef pair<LL, LL> pii;

 typedef pair<string, LL> psi;

 typedef map<string, LL> msi;

 typedef vector<LL> vi;

 typedef vector<LL> vl;

 typedef vector<vl> vvl;

 typedef vector<bool> vb;

 const int maxn = ;

 int n;

 int a[maxn];

 int p;

 int main() {

 //    FRead();

     int T;

     Rint(T);

     W(T) {

         Rint(n);

         Rep(i, n) {

             Rint(a[i]);

         }

         p = a[];

         For(i, , n) {

             p = __gcd(p, a[i]);

         }

         int ret = ;

         Rep(i, n) {

             a[i] /= p;

             ret += a[i];

         }

         printf("%d %d\n", p, ret);

     }

     RT ;

 }

E

F.两个字符串AB，B只有4个字符，问B是否是A的子串。如果不是的话，有一次机会可以在A中拆成两部分，这两部分中间只有一个字符，分别输出结果。一个flag标记就行。

 /*

 ━━━━━┒ギリギリ♂ eye！

 ┓┏┓┏┓┃キリキリ♂ mind！

 ┛┗┛┗┛┃＼○／

 ┓┏┓┏┓┃ /

 ┛┗┛┗┛┃ノ)

 ┓┏┓┏┓┃

 ┛┗┛┗┛┃

 ┓┏┓┏┓┃

 ┛┗┛┗┛┃

 ┓┏┓┏┓┃

 ┛┗┛┗┛┃

 ┓┏┓┏┓┃

 ┃┃┃┃┃┃

 ┻┻┻┻┻┻

 */

 #include <algorithm>

 #include <iostream>

 #include <iomanip>

 #include <cstring>

 #include <climits>

 #include <complex>

 #include <cassert>

 #include <cstdio>

 #include <bitset>

 #include <vector>

 #include <deque>

 #include <queue>

 #include <stack>

 #include <ctime>

 #include <set>

 #include <map>

 #include <cmath>

 #include <set>

 using namespace std;

 #define fr first

 #define sc second

 #define cl clear

 #define BUG puts("here!!!")

 #define W(a) while(a--)

 #define pb(a) push_back(a)

 #define Rint(a) scanf("%d", &a)

 #define Rll(a) scanf("%I64d", &a)

 #define Rs(a) scanf("%s", a)

 #define Cin(a) cin >> a

 #define FRead() freopen("in", "r", stdin)

 #define FWrite() freopen("out", "w", stdout)

 #define Rep(i, len) for(LL i = 0; i < (len); i++)

 #define For(i, a, len) for(LL i = (a); i < (len); i++)

 #define Cls(a) memset((a), 0, sizeof(a))

 #define Clr(a, x) memset((a), (x), sizeof(a))

 #define Fuint(a) memset((a), 0x7f7f, sizeof(a))

 #define lrt rt << 1

 #define rrt rt << 1 | 1

 #define pi 3.14159265359

 #define RT return

 #define lowbit(x) x & (-x)

 #define onenum(x) __builtin_popcount(x)

 typedef long long LL;

 typedef long double LD;

 typedef unsigned long long Uint;

 typedef pair<LL, LL> pii;

 typedef pair<string, LL> psi;

 typedef map<string, LL> msi;

 typedef vector<LL> vi;

 typedef vector<LL> vl;

 typedef vector<vl> vvl;

 typedef vector<bool> vb;

 const int maxn = ;

 char a[maxn], b[maxn];

 int n;

 int main() {

 //    FRead();

     int T;

     Rint(T);

     W(T) {

         Rs(a); Rs(b);

         n = strlen(a);

         int ret = ;

         bool ff = ;

         bool exflag = ;

         Rep(i, n-) {

             if(exflag) break;

             int tmp = ;

             bool flag = ;

             int k = i;

             Rep(j, ) {

                 if(a[k+j] == b[j]) tmp++;

                 else if(!flag) {

                     tmp++;

                     k--;

                     flag = ;

                 }

             }

             if(tmp > ret) {

                 ret = tmp;

                 ff = flag;

             }

             if(ret ==  && !flag) {

                 exflag = ;

                 puts("good");

                 break;

             }

         }

         if(exflag) continue;

         if(ff && ret == ) puts("almost good");

         else if(ret == ) {

             puts("good");

         }

         else puts("none");

     }

     RT ;

 }

F

G.每w-1个为一组，分情况讨论就可以。

 /*

 ━━━━━┒ギリギリ♂ eye！

 ┓┏┓┏┓┃キリキリ♂ mind！

 ┛┗┛┗┛┃＼○／

 ┓┏┓┏┓┃ /

 ┛┗┛┗┛┃ノ)

 ┓┏┓┏┓┃

 ┛┗┛┗┛┃

 ┓┏┓┏┓┃

 ┛┗┛┗┛┃

 ┓┏┓┏┓┃

 ┛┗┛┗┛┃

 ┓┏┓┏┓┃

 ┃┃┃┃┃┃

 ┻┻┻┻┻┻

 */

 #include <algorithm>

 #include <iostream>

 #include <iomanip>

 #include <cstring>

 #include <climits>

 #include <complex>

 #include <cassert>

 #include <cstdio>

 #include <bitset>

 #include <vector>

 #include <deque>

 #include <queue>

 #include <stack>

 #include <ctime>

 #include <set>

 #include <map>

 #include <cmath>

 #include <set>

 using namespace std;

 #define fr first

 #define sc second

 #define cl clear

 #define BUG puts("here!!!")

 #define W(a) while(a--)

 #define pb(a) push_back(a)

 #define Rint(a) scanf("%d", &a)

 #define Rll(a) scanf("%I64d", &a)

 #define Rs(a) scanf("%s", a)

 #define Cin(a) cin >> a

 #define FRead() freopen("in", "r", stdin)

 #define FWrite() freopen("out", "w", stdout)

 #define Rep(i, len) for(LL i = 0; i < (len); i++)

 #define For(i, a, len) for(LL i = (a); i < (len); i++)

 #define Cls(a) memset((a), 0, sizeof(a))

 #define Clr(a, x) memset((a), (x), sizeof(a))

 #define Fuint(a) memset((a), 0x7f7f, sizeof(a))

 #define lrt rt << 1

 #define rrt rt << 1 | 1

 #define pi 3.14159265359

 #define RT return

 #define lowbit(x) x & (-x)

 #define onenum(x) __builtin_popcount(x)

 typedef long long LL;

 typedef long double LD;

 typedef unsigned long long Uint;

 typedef pair<LL, LL> pii;

 typedef pair<string, LL> psi;

 typedef map<string, LL> msi;

 typedef vector<LL> vi;

 typedef vector<LL> vl;

 typedef vector<vl> vvl;

 typedef vector<bool> vb;

 int h, w, d;

 #define y puts("Yes");

 #define n puts("No");

 int main() {

 //    FRead();

     int T;

     Rint(T);

     W(T) {

         scanf("%d%d%d",&h,&w,&d);

         int p = h / (w - );

         int q = h % (w - );

         if(q == ) {

             if(p & ) {

                 if(w -  == d) y

                 else n

             }

             else {

                 if(d == ) y

                 else n

             }

         }

         else {

             if(p & ) {

                 if(d == w - q + ) y

                 else n

             }

             else {

                 if(d == q) y

                 else n

             }

         }

     }

     RT ;

 }

G

H.一开始我还找规律，结果最后暴力模拟就可以了。

 /*

 ━━━━━┒ギリギリ♂ eye！

 ┓┏┓┏┓┃キリキリ♂ mind！

 ┛┗┛┗┛┃＼○／

 ┓┏┓┏┓┃ /

 ┛┗┛┗┛┃ノ)

 ┓┏┓┏┓┃

 ┛┗┛┗┛┃

 ┓┏┓┏┓┃

 ┛┗┛┗┛┃

 ┓┏┓┏┓┃

 ┛┗┛┗┛┃

 ┓┏┓┏┓┃

 ┃┃┃┃┃┃

 ┻┻┻┻┻┻

 */

 #include <algorithm>

 #include <iostream>

 #include <iomanip>

 #include <cstring>

 #include <climits>

 #include <complex>

 #include <cassert>

 #include <cstdio>

 #include <bitset>

 #include <vector>

 #include <deque>

 #include <queue>

 #include <stack>

 #include <ctime>

 #include <set>

 #include <map>

 #include <cmath>

 #include <set>

 using namespace std;

 #define fr first

 #define sc second

 #define cl clear

 #define BUG puts("here!!!")

 #define W(a) while(a--)

 #define pb(a) push_back(a)

 #define Rint(a) scanf("%d", &a)

 #define Rll(a) scanf("%I64d", &a)

 #define Rs(a) scanf("%s", a)

 #define Cin(a) cin >> a

 #define FRead() freopen("in", "r", stdin)

 #define FWrite() freopen("out", "w", stdout)

 #define Rep(i, len) for(LL i = 0; i < (len); i++)

 #define For(i, a, len) for(LL i = (a); i < (len); i++)

 #define Cls(a) memset((a), 0, sizeof(a))

 #define Clr(a, x) memset((a), (x), sizeof(a))

 #define Fuint(a) memset((a), 0x7f7f, sizeof(a))

 #define lrt rt << 1

 #define rrt rt << 1 | 1

 #define pi 3.14159265359

 #define RT return

 #define lowbit(x) x & (-x)

 #define onenum(x) __builtin_popcount(x)

 typedef long long LL;

 typedef long double LD;

 typedef unsigned long long Uint;

 typedef pair<LL, LL> pii;

 typedef pair<string, LL> psi;

 typedef map<string, LL> msi;

 typedef vector<LL> vi;

 typedef vector<LL> vl;

 typedef vector<vl> vvl;

 typedef vector<bool> vb;

 const int maxn = ;

 int n, d, r;

 bool a[maxn], b[maxn];

 int main() {

 //    FRead();

     int T;

     Rint(T);

     W(T) {

         scanf("%d%d%d",&n,&d,&r);

         Cls(a); Cls(b);

         int aa = , bb = ;

         int ret = ;

         while() {

             ret++;

             aa = ret * d % n;

             if(b[aa] == ) break;

             a[aa] = ;

             bb = ret * r % n;

             if(a[bb] == ) break;

             b[bb] = ;

         }

         printf("%d\n", ret);

     }

     RT ;

 }

H

I.最大值最小的问题，枚举虽有长度判断是否满足k条就行。套路二分。

 /*

 ━━━━━┒ギリギリ♂ eye！

 ┓┏┓┏┓┃キリキリ♂ mind！

 ┛┗┛┗┛┃＼○／

 ┓┏┓┏┓┃ /

 ┛┗┛┗┛┃ノ)

 ┓┏┓┏┓┃

 ┛┗┛┗┛┃

 ┓┏┓┏┓┃

 ┛┗┛┗┛┃

 ┓┏┓┏┓┃

 ┛┗┛┗┛┃

 ┓┏┓┏┓┃

 ┃┃┃┃┃┃

 ┻┻┻┻┻┻

 */

 #include <algorithm>

 #include <iostream>

 #include <iomanip>

 #include <cstring>

 #include <climits>

 #include <complex>

 #include <cassert>

 #include <cstdio>

 #include <bitset>

 #include <vector>

 #include <deque>

 #include <queue>

 #include <stack>

 #include <ctime>

 #include <set>

 #include <map>

 #include <cmath>

 #include <set>

 using namespace std;

 #define fr first

 #define sc second

 #define cl clear

 #define BUG puts("here!!!")

 #define W(a) while(a--)

 #define pb(a) push_back(a)

 #define Rint(a) scanf("%d", &a)

 #define Rll(a) scanf("%I64d", &a)

 #define Rs(a) scanf("%s", a)

 #define Cin(a) cin >> a

 #define FRead() freopen("in", "r", stdin)

 #define FWrite() freopen("out", "w", stdout)

 #define Rep(i, len) for(LL i = 0; i < (len); i++)

 #define For(i, a, len) for(LL i = (a); i < (len); i++)

 #define Cls(a) memset((a), 0, sizeof(a))

 #define Clr(a, x) memset((a), (x), sizeof(a))

 #define Fuint(a) memset((a), 0x7f7f, sizeof(a))

 #define lrt rt << 1

 #define rrt rt << 1 | 1

 #define pi 3.14159265359

 #define RT return

 #define lowbit(x) x & (-x)

 #define onenum(x) __builtin_popcount(x)

 typedef long long LL;

 typedef long double LD;

 typedef unsigned long long Uint;

 typedef pair<LL, LL> pii;

 typedef pair<string, LL> psi;

 typedef map<string, LL> msi;

 typedef vector<LL> vi;

 typedef vector<LL> vl;

 typedef vector<vl> vvl;

 typedef vector<bool> vb;

 const int maxn = ;

 int a[maxn];

 int n, k;

 bool check(int x) {

     int s = a[], t = s + x - ;

     int cnt = ;

     For(i, , n+) {

         if(a[i] <= t) continue;

         else {

             s = a[i];

             t = s + x - ;

             cnt++;

         }

     }

     if(cnt <= k) return ;

     return ;

 }

 int main() {

 //    FRead();

     int T;

     Rint(T);

     W(T) {

         Rint(n); Rint(k);

         For(i, , n+) Rint(a[i]);

         int ll = -, rr = a[n];

         while(rr >= ll) {

             int mm = (rr + ll) >> ;

             if(check(mm)) rr = mm - ;

             else ll = mm + ;

         }

         printf("%d\n", rr+);

     }

     RT ;

 }

 close

I

J.先O(n*lgn)扫出所有a的v值，再将a求一遍LIS，价值为v统计就行了。

 /*

 ━━━━━┒ギリギリ♂ eye！

 ┓┏┓┏┓┃キリキリ♂ mind！

 ┛┗┛┗┛┃＼○／

 ┓┏┓┏┓┃ /

 ┛┗┛┗┛┃ノ)

 ┓┏┓┏┓┃

 ┛┗┛┗┛┃

 ┓┏┓┏┓┃

 ┛┗┛┗┛┃

 ┓┏┓┏┓┃

 ┛┗┛┗┛┃

 ┓┏┓┏┓┃

 ┃┃┃┃┃┃

 ┻┻┻┻┻┻

 */

 #include <algorithm>

 #include <iostream>

 #include <iomanip>

 #include <cstring>

 #include <climits>

 #include <complex>

 #include <cassert>

 #include <cstdio>

 #include <bitset>

 #include <vector>

 #include <deque>

 #include <queue>

 #include <stack>

 #include <ctime>

 #include <set>

 #include <map>

 #include <cmath>

 #include <set>

 using namespace std;

 #define fr first

 #define sc second

 #define cl clear

 #define BUG puts("here!!!")

 #define W(a) while(a--)

 #define pb(a) push_back(a)

 #define Rint(a) scanf("%d", &a)

 #define Rll(a) scanf("%I64d", &a)

 #define Rs(a) scanf("%s", a)

 #define Cin(a) cin >> a

 #define FRead() freopen("in", "r", stdin)

 #define FWrite() freopen("out", "w", stdout)

 #define Rep(i, len) for(LL i = 0; i < (len); i++)

 #define For(i, a, len) for(LL i = (a); i < (len); i++)

 #define Cls(a) memset((a), 0, sizeof(a))

 #define Clr(a, x) memset((a), (x), sizeof(a))

 #define Fuint(a) memset((a), 0x7f7f, sizeof(a))

 #define lrt rt << 1

 #define rrt rt << 1 | 1

 #define pi 3.14159265359

 #define RT return

 #define lowbit(x) x & (-x)

 #define onenum(x) __builtin_popcount(x)

 typedef long long LL;

 typedef long double LD;

 typedef unsigned long long Uint;

 typedef pair<LL, LL> pii;

 typedef pair<string, LL> psi;

 typedef map<string, LL> msi;

 typedef vector<LL> vi;

 typedef vector<LL> vl;

 typedef vector<vl> vvl;

 typedef vector<bool> vb;

 const int maxn = ;

 int n;

 int a[maxn];

 int v[maxn];

 int dp[maxn];

 int f(int x) {

     if(x & ) return ;

     int p = ;

     int cur = ;

     while(x >= cur && x % cur == ) {

         cur <<= ;

         p++;

     }

     return p - ;

 }

 int main() {

 //    FRead();

     int T;

     Rint(T);

     W(T){

         Rint(n);

         For(i, , n+) {

             Rint(a[i]);

             v[i] = f(a[i]);

         }

         int ret = v[]; Cls(dp);

         For(i, , n+) dp[i] = v[i];

         For(i, , n+) {

 //            dp[i] = v[i];

             For(j, , i) {

                 if(a[i] > a[j]) {

                     dp[i] = max(dp[i], dp[j]+v[i]);

                 }

             }

             ret = max(ret, dp[i]);

         }

         printf("%d\n", ret);

     }

     RT ;

 }

J

[CFGym101028] 2016 Al-Baath University Training Camp Contest-1的更多相关文章

  1. 2016 Al-Baath University Training Camp Contest-1

    2016 Al-Baath University Training Camp Contest-1 A题:http://codeforces.com/gym/101028/problem/A 题意:比赛 ...

  2. 2014-2015 Petrozavodsk Winter Training Camp, Contest.58 (Makoto rng_58 Soejima contest)

    2014-2015 Petrozavodsk Winter Training Camp, Contest.58 (Makoto rng_58 Soejima contest) Problem A. M ...

  3. 2016 Al-Baath University Training Camp Contest-1 E

    Description ACM-SCPC-2017 is approaching every university is trying to do its best in order to be th ...

  4. 2016 Al-Baath University Training Camp Contest-1 B

    Description A group of junior programmers are attending an advanced programming camp, where they lea ...

  5. 2016 Al-Baath University Training Camp Contest-1 A

    Description Tourist likes competitive programming and he has his own Codeforces account. He particip ...

  6. 2016 Al-Baath University Training Camp Contest-1 J

    Description X is fighting beasts in the forest, in order to have a better chance to survive he's gon ...

  7. 2016 Al-Baath University Training Camp Contest-1 I

    Description It is raining again! Youssef really forgot that there is a chance of rain in March, so h ...

  8. 2016 Al-Baath University Training Camp Contest-1 H

     Description You've possibly heard about 'The Endless River'. However, if not, we are introducing it ...

  9. 2016 Al-Baath University Training Camp Contest-1 G

    Description The forces of evil are about to disappear since our hero is now on top on the tower of e ...

随机推荐

  1. 【BZOJ】【1221】【HNOI2001】软件开发

    网络流/费用流 说是这题跟餐巾计划一模一样……但我没做过啊……so sad 二分图建模是很好想的,但是要控制流量跟用了的毛巾一样多……oh my god 事实上对于每一天我们无论如何都是要消耗n[i] ...

  2. Java内存模型(JMM)

    参考: 1. http://www.tuicool.com/articles/UVzuQb

  3. [noip2005提高]过河 dp

    由于L的范围到了109,用普通dp做肯定是不成了: 可以观察到M的数量很小,dp在转移的过程中有大量的无用转移: 可以想到压缩范围,问题是如何压缩,观察若S=9,T=10时,能到达的点,9,10,18 ...

  4. 【JQuery NoviceToNinja系列】目录

    [JQuery NoviceToNinja系列]目录 [JQuery NoviceToNinja系列]01 开篇 Html页面设计和布局

  5. remoting技术

    转: http://www.cnblogs.com/rickie/category/5082.html

  6. .NET中JSON的序列化和反序列化

    .NET 中有两种方法进行JSON的操作分别需要引用不同的命名空间 1.System.Runtime.Serialization.Json(System.Runtime.Serialization.d ...

  7. Sqli-labs less 34

    Less-34 本关是post型的注入漏洞,同样的也是将post过来的内容进行了 ' \ 的处理.由上面的例子可以看到我们的方法就是将过滤函数添加的 \ 给吃掉.而get型的方式我们是以url形式提交 ...

  8. pyhton Chapter3 读文件

    使用内置函数open()打开文件,data=open("1.txt").利用data.close()关闭文件.利用data.readline()读取文件中的一行数据,然后指示读取文 ...

  9. HDU 4632 Palindrome subsequence(区间dp，回文串，字符处理)

    题目 参考自博客:http://blog.csdn.net/u011498819/article/details/38356675 题意:查找这样的子回文字符串(未必连续,但是有从左向右的顺序)个数. ...

  10. JavaScript call和apply的用法

    <!DOCTYPE html> <html xmlns="http://www.w3.org/1999/xhtml"> <head> <m ...