9-22训练赛

C - A Cookie for You CodeForces - 1371C

题意 : 用菱形组成图示图按 有几种方案
思路 : 恶心的一比 刚开始没看懂wa了好激发 实际输出n即可
代码：

#include<iostream>
#include<queue>
#include<stack>
#include<cstring>
#include<stdlib.h>
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<map>
#include<stdio.h>
#include<string>


#define LL long long
using namespace std;
#define MAXN 1000011
#define inf 100000001
#define sd1(i) scanf("%d", &i)
#define sd2(i, j) scanf("%d%d", &i, &j)
#define sl2(i, j) scanf("%lld%lld", &i, &j)
#define sd3(i, j, k) scanf("%d%d%d", &i, &j, &k)

//LL pow(LL a, LL b){

//}
int T;
LL N;
int main(){
    sd1(T);
    for(int i =0; i < T; i++){
        sd1(N);
        cout << N << endl;
        /*if(N == 1) cout << 1 << endl;
        if(N == 2) cout << 2 << endl;
        cout << 2*pow(2, (double)N-2) << endl;;*/
    }
    //system("pause");
    return 0;
}

B - Sorted Adjacent Differences CodeForces - 1339B

题意 : 排序使得两数之差的绝对值非递减
思路: 按大小排序 然后首位交替取即可
代码：

#include<iostream>
#include<queue>
#include<stack>
#include<cstring>
#include<stdlib.h>
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<map>
#include<stdio.h>
#include<string>


#define LL long long
using namespace std;
#define MAXN 100011
#define inf 100000001
#define sd1(i) scanf("%d", &i)
#define sd2(i, j) scanf("%d%d", &i, &j)
#define sl2(i, j) scanf("%lld%lld", &i, &j)
#define sd3(i, j, k) scanf("%d%d%d", &i, &j, &k)

int T;
int N;
int a[MAXN];
int ans[MAXN];

void Print(){
    for(int i = N-1; i >= 0; i--){
        if(i == N-1) cout << ans[i];
        else cout << ' ' << ans[i];
    }
    cout << endl;
}
int main(){
    sd1(T);
    for(int i = 0; i < T; i++){
        sd1(N);
        for(int j = 0; j < N; j++){
            sd1(a[j]);  
        }
        sort(a, a+N);
        int k = 0;
        if(N % 2 == 0)
            for(int j = 0; j < N/2; j++){
                ans[k++] = a[j];
                ans[k++] = a[N-j-1];
            }
        else {
            for(int j = 0; j < N/2; j++){
                ans[k++] = a[j];
                ans[k++] = a[N-j-1];
            }
            ans[k++] =  a[N/2];
        }

        Print();

    }
    //system("pause");
}

C - Powered Addition CodeForces - 1339C

题意 ： x由1增加， 每次都可以选择一些数然后加上pow（2， x-1），使得数列不低见， 问x最小加到多少？
思路: 找到前后最大的差即可 它满足了其他也就满足了 不断更新max与差
注意 : 求解时不是log 不知道自己为啥会写log 还wa了好久 还是太想当然了，应该再纸上列出来的
代码：

#include<iostream>
#include<queue>
#include<stack>
#include<cstring>
#include<stdlib.h>
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<map>
#include<stdio.h>
#include<string>
#include<cmath>


#define LL long long
using namespace std;
#define MAXN 100011
#define inf 100000001
#define sd1(i) scanf("%d", &i)
#define sd2(i, j) scanf("%d%d", &i, &j)
//#define sl2(i, j) scanf("%intd%intd", &i, &j)
#define sd3(i, j, k) scanf("%d%d%d", &i, &j, &k)

int T;
int N;
int a[MAXN];
int f(int n){
    int sum = 0;
    int i = 0;
    for(i = 0; ;i++){
        sum += pow(2, i);
        if(sum >= n) return i+1;
    }
}
int main(){
    sd1(T);
    while(T--){
        sd1(N);
       
        for(int i = 0; i < N; i++){
            sd1(a[i]);
        } 
        if(N == 1) {
            cout << 0 << endl;
            continue;
        }
        int maxx = a[0];
        int minn = a[0] - a[1];
        int ans = 0;
        for(int i = 0 ; i < N; i++){
            if(a[i] >= maxx) maxx = a[i];
            if(maxx - a[i] >= minn) minn = maxx - a[i];
        }
        if(minn == 0) ans = 0;
        else ans = f(minn);
        //cout << endl;
        cout << ans << endl;
        //cout << endl;
    }
    //system("pause");
}