[CFGym101028] 2016 Al-Baath University Training Camp Contest-1

比赛链接：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 ;

 }

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 ;

 }

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 ;

 }

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 ;

 }

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 ;

 }

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 ;

 }

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 ;

 }

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 ;

 }

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

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 ;

 }

[CFGym101028] 2016 Al-Baath University Training Camp Contest-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 题意:比赛 ...
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 ...
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 ...
2016 Al-Baath University Training Camp Contest-1 B
Description A group of junior programmers are attending an advanced programming camp, where they lea ...
2016 Al-Baath University Training Camp Contest-1 A
Description Tourist likes competitive programming and he has his own Codeforces account. He particip ...
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 ...
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 ...
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 ...
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 ...

随机推荐

【BZOJ】【1049】【HAOI2006】数字序列
DP 第一问比较水……a[i]-=i 以后就变成最长不下降子序列问题了,第二问这个结论好神奇,考试的时候怎么破?大胆猜想,不用证明?TAT 题解:http://pan.baidu.com/share/ ...
【转载】C++——CString用法大全
CString常用方法简介作者:webmaster 出处:无 CString::Compareint Compare( LPCTSTR lpsz ) const;返回值字符串一样返回0 ...
Nsdate的各种常用操作
// // NVDate.h // // Created by Noval Agung Prayogo on 2/5/14. // Copyright (c) 2014 Noval Agung ...
为现代JavaScript开发做好准备
今天无论是在浏览器中还是在浏览器外,JavaScript世界正在经历翻天覆地地变化.如果我们谈论脚本加载.客户端的MVC框架.压缩器.AMD.Common.js还有Coffeescript……只会让你 ...
SWF Web播放器
<HTML> <HEAD>  <TITLE> Untitled. ...
linux权威指南简记
/proc 目录,linxu系统以文件形式存放进程信息,这是一个虚拟的文件系统,不占有任何磁盘空间,当读取该文件系统时,系统内核会拦截动作,并动态产生文件与目录的内容查看该文件夹,会发现很多已数字命 ...
03server平台delphi程序不支持直接调用webservice
经过多次测试和查证,发现03server平台用delphi7.0开发的应用程序就是不支持直接调用webservice,无论这个webservice是delphi开发的还是C#开发,抑或是java开发的 ...
Shell实现跳板机，为什么用跳板机
整理自:http://blog.chinaunix.net/uid-22101889-id-3167454.html 注意:请谨慎使用,到现在为止,使用了,我还没找到改回去的方法. 1. 问题 ...
android 四大组件Broadcast Receiver
本文介绍Broadcast Receiver,包括几部分内容:Broadcast Receiver概述及实例.自定义Broadcast Receiver.Broadcast Receiver的实现细节 ...
机器学习之神经网络模型-上（Neural Networks: Representation）
在这篇文章中,我们一起来讨论一种叫作"神经网络"(Neural Network)的机器学习算法,这也是我硕士阶段的研究方向.我们将首先讨论神经网络的表层结构,在之后再具体讨论神经网 ...

[CFGym101028] 2016 Al-Baath University Training Camp Contest-1

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

随机推荐

热门专题