2018浙江省省赛

A - Peak ZOJ - 4024

题目大意：判断数列是否是先递增后递减数列  

从两端分别以递增和递减判断 看第一个不满足递增或递减的数是否相等并且没越界就可以了

#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#include<map>
#include<set>
int main(){
    int t;
    scanf("%d", &t);
    int n;
    int a[100005];
    while (t--){
        memset(a, 0, sizeof(a));
        scanf("%d", &n);
        for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
        int l = 1, r = n;
        while (l < n && a[l] < a[l + 1]) l++;
        while (r > 1 && a[r] < a[r - 1]) r--;
        if (l == r && l != 1 && l != n) cout<<"Yes"<<endl;
        else cout<<"No"<<endl;
    }
    return 0;
}

B - King of Karaoke ZOJ - 4025 

求两个序列的相对元素的差出现次数最多的，最低出现一次。

#include <iostream>
#include <cstdio>
#include <map>
using namespace std;
const int maxn = 100005;
int test,n,d[maxn],x;
int main()
{
    ios::sync_with_stdio(false);
    cin >> test;
    while (test--)
    {
        cin >> n;
        for (int i = 0;i < n;i++) cin >> d[i];
        map<int, int> mp;
        int ans = 1;
        for (int i = 0;i < n;i++)
        {
            cin >> x;
            mp[d[i] - x]++;
            if (mp[d[i] - x] > ans)
                ans = mp[d[i] - x];
        }
        cout << ans << endl;
    }
    return 0;
}

 I - Magic Points ZOJ - 4032 

题意：给你3n个点，编号从0到3n-1，呈正方形分布，找n对点连起来，让线与线的交点经可能多。

题解：最下面的这n个点，前n - 1个点和第n + 1到 2n - 1个点相连，第n个点和第3n - 2个相连。特判一下n == 2 的情况。

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <queue>
using namespace std;
typedef long long ll;
int main()
{
    int t, n;
    scanf("%d", &t);
    while (t--)
    {
        scanf("%d", &n);
        if (n == 2) {
            printf("0 2 1 3\n");
            continue;
        }
        for (int i = 0; i < n - 1; i++)
        {
            printf("%d %d ", i, i + n);
        }
        printf("%d %d\n", n - 1, 3 * n - 2);
    }
    return 0;
}

J - CONTINUE...? ZOJ - 4033 

题意:第一行给出T代表有几个测试样例，第二行给出n代表有几个人，第三行给出一个由0和1组成的字符串，0代表女生，1代表男生。并且第i个人有i个宝石。现在要把这些人分为四组，G1 G2 两组是女生组，G3 G4两组是男生组。分配后要满足  （G1+G3)的宝石 ==(G2+G4)的宝石然后输出这些人被分配到哪一组的字符串。如果有多个结果随便哪一个都行，如果没有结果输出-1。

#include<iostream>
#include<map>
#include<cstring>
#include<algorithm>
#include<vector>
#include<cmath>
#include<queue>
#include<cstdio>
#include<set>
#define inf 0x3f3f3f3f
const int maxn = 110;
using namespace std;
int main() {
    int T;
    scanf("%d", &T);
    while (T--) {
        long long int n;
        scanf("%lld", &n);//因为要求下面的sum，如果是int就会爆。
        char s[100010];
        long long str[100010] = { 0 };
        getchar();
        for (int i = 1;i <= n;i++)scanf("%c", &s[i]);
        long long sum =  n * (n + 1) / 2;
        if (sum % 2 != 0) { puts("-1");continue; }
        long long half = sum / 2;
        for (int i = n;i >= 1;i--) {
            if (half >= i) {
                if (s[i] == '1')str[i] = 3;
                else str[i] = 1;
                half -= i;
                if (half == 0)break;
            }
            else {
                if (s[i] == '1')str[i] = 4;
                else str[i] = 2;
            }
        }
        for (int i = 1;i <= n;i++) {
            if (str[i] == 0) {
                if (s[i] == '1')str[i] = 4;
                else str[i] = 2;
            }
        }
        for (int i = 1;i <= n;i++)printf("%lld", str[i]);
        printf("\n");
    }
    return 0;
}

 L - Doki Doki Literature Club ZOJ - 4035

#include<iostream>
#include<map>
#include<cstring>
#include<algorithm>
#include<vector>
#include<cmath>
#include<queue>
#include<cstdio>
#include<set>
#define inf 0x3f3f3f3f
const int maxn = 110;
using namespace std;
struct node {
    string word;
    long long int num;
}N[maxn];
bool cmp(node a,node b) {
    if (a.num != b.num)return a.num > b.num;
    return a.word < b.word;
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int T;
    cin >> T;
    while (T--) {
        int n, m;
        cin >> n >> m;
        string word;
        int num;
        for (int i = 1;i <= n;i++) {
            cin >> N[i].word >> N[i].num;
        }
        sort(N + 1, N + 1 + n, cmp);
        long long ans = 0;
        for (int i = 1;i <= m;i++) {
            ans = ans + N[i].num * (m - i + 1);
        }
        cout << ans << " " ;
        for (int i = 1;i <= m;i++) {
            if (i == m)cout << N[i].word << endl;
            else cout << N[i].word << " ";
        }
    }
    return 0;
}

 

M - Lucky 7 ZOJ - 4036

#include<iostream>
#include<map>
#include<cstring>
#include<algorithm>
#include<vector>
#include<cmath>
#include<queue>
#include<cstdio>
#define inf 0x3f3f3f3f
#define maxn 1010
using namespace std;
int main() {
    int T;
    scanf("%d", &T);
    while (T--) {
        int n, m,arr[maxn];
        scanf("%d%d", &n, &m);
        int flag = 0;
        for (int i = 1;i <= n;i++) {
            scanf("%d", &arr[i]);
            if ((arr[i] + m) % 7 == 0) { flag = 1; }
        }
        if (flag)puts("Yes");
        else puts("No");
    }
    return 0;
}