Codeforces 957 水位标记思维题

A

#include <bits/stdc++.h>
#define PI acos(-1.0)
#define mem(a,b) memset((a),b,sizeof(a))
#define TS printf("!!!\n")
#define pb push_back
#define inf 1e9
//std::ios::sync_with_stdio(false);
using namespace std;
//priority_queue<int,vector<int>,greater<int>> que; get min
const double eps = 1.0e-10;
const double EPS = 1.0e-4;
typedef pair<int, int> pairint;
typedef long long ll;
typedef unsigned long long ull;
//const int maxn = 3e5 + 10;
const int turn[][] = {{, }, { -, }, {, }, {, -}};
//priority_queue<int, vector<int>, less<int>> que;
//next_permutation
string a;
int anser = ;
int main()
{
        int n;
        cin >> n;
        cin >> a;
        int len = a.size();
        for (int i = ; i < len - ; i++)
        {
                if (a[i] == a[i + ] && a[i] != '?')
                {
                        cout << "No" << endl;
                        return ;
                }
        }
        if (a[] == '?' || a[len - ] == '?')
        {
                cout << "Yes" << endl;
                return ;
        }
        for (int i = ; i < len - ; i++)
        {
                if (a[i] == '?' && (a[i - ] == a[i + ]))
                {
                        cout << "Yes" << endl;
                        return ;
                }
        }
        for (int i = ; i < len - ; i++)
        {
                if (a[i] == a[i + ] && a[i] == '?')
                {
                        cout << "Yes" << endl;
                        return ;
                }
        }
        cout << "No" << endl;
}

B

#include <bits/stdc++.h>
#define PI acos(-1.0)
#define mem(a,b) memset((a),b,sizeof(a))
#define TS printf("!!!\n")
#define pb push_back
#define inf 1e9
//std::ios::sync_with_stdio(false);
using namespace std;
//priority_queue<int,vector<int>,greater<int>> que; get min
const double eps = 1.0e-10;
const double EPS = 1.0e-4;
typedef pair<int, int> pairint;
typedef long long ll;
typedef unsigned long long ull;
//const int maxn = 3e5 + 10;
const int turn[][] = {{, }, { -, }, {, }, {, -}};
//priority_queue<int, vector<int>, less<int>> que;
//next_permutation
char f[][];
int hang[];
int main()
{
        int n, m;
        int sum = ;
        cin >> n >> m;
        for (int i = ; i <= n; i++)
        {
                scanf("%s", f[i] + );
        }
        for (int i = ; i <= n; i++)
        {
                if (hang[i])
                {
                        continue;
                }
                for (int j = ; j <= m; j++)
                {
                        if (f[i][j] == '#')
                        {
                                //cout << i << " " << j << endl;
                                for (int k = ; k <= n; k++)
                                {
                                        if (k == i)
                                        {
                                                continue;
                                        }
                                        if (f[k][j] == '#')
                                        {
                                               // cout << "find" << k << " " << j << endl;
                                                for (int w = ; w <= m; w++)
                                                {
                                                        if (f[k][w] != f[i][w])
                                                        {
                                                                cout << "No" << endl;
                                                                return ;
                                                        }
                                                }
                                                hang[k] = ;
                                        }
                                }
                        }
                }
        }
        cout << "Yes" << endl;
        return ;
}

C

#include <bits/stdc++.h>
#define PI acos(-1.0)
#define mem(a,b) memset((a),b,sizeof(a))
#define TS printf("!!!\n")
#define pb push_back
#define inf 1e9
//std::ios::sync_with_stdio(false);
using namespace std;
//priority_queue<int,vector<int>,greater<int>> que; get min
const double eps = 1.0e-10;
const double EPS = 1.0e-4;
typedef pair<int, int> pairint;
typedef long long ll;
typedef unsigned long long ull;
//const int maxn = 3e5 + 10;
const int turn[][] = {{, }, { -, }, {, }, {, -}};
//priority_queue<int, vector<int>, less<int>> que;
//next_permutation
int num[];
int main()
{
        double anser = -;
        int n, u;
        cin >> n >> u;
        num[n + ] = INT_MAX;
        for (int i = ; i <= n; i++)
        {
                scanf("%d", num + i);
        }
        for (int i = ; i <= n - ; i++)
        {
                int now = num[i];
                int cha = num[i + ] - num[i];
                int aim = upper_bound(num + , num + n + , num[i] + u) - num - ;
                if (aim - i <=  || aim > n)
                {
                        continue;
                }
                //cout << i << " " << aim << endl;
                anser = max(anser, (double)(num[aim] - num[i] - cha) / (double)(num[aim] - num[i]));
        }
        if (anser == -)
        {
                cout << anser << endl;
        }
        else
        {
                printf("%.10f\n", anser);
        }
        return ;
}

D

假设在第i次量的时候的总标记数为sum[i] 可知其必定为非递减函数 sum[i]=d[i]+m[i]+1

要使d[i]的总值最小则 要在m[i]+1上面再加数使得 m[i]>=m[i-1]&&m[i+1]-1<=m[i]<=m[i+1]

先从前往后扫一遍满足第一个条件 再从往前扫一遍满足第二个条件

注意要开LL

#include <bits/stdc++.h>
#define PI acos(-1.0)
#define mem(a,b) memset((a),b,sizeof(a))
#define TS printf("!!!\n")
#define pb push_back
#define inf 1e9
//std::ios::sync_with_stdio(false);
using namespace std;
//priority_queue<int,vector<int>,greater<int>> que; get min
const double eps = 1.0e-10;
const double EPS = 1.0e-4;
typedef pair<int, int> pairint;
typedef long long ll;
typedef unsigned long long ull;
//const int maxn = 3e5 + 10;
const int turn[][] = {{, }, { -, }, {, }, {, -}};
//priority_queue<int, vector<int>, less<int>> que;
//next_permutation
ll num[];
int main()
{
        int n;
        cin >> n;
        ll maxn = - ;
        ll ans = ;
        for (int i = ; i <= n; i++)
        {
                scanf("%lld", num + i);
                maxn = max(maxn, num[i]);
        }
        for (int i = ; i <= n - ; i++)
        {
                if (num[i + ] < num[i])
                {
                        ans += num[i] - num[i + ];
                        num[i + ] = num[i];
                }
        }
        for (int i = n; i >= ; i--)
        {
                if (num[i] - num[i - ] > )
                {
                        ans += num[i] -  - num[i - ];
                        num[i - ] = num[i] - ;
                }
        }
        cout << ans << endl;
        return ;
}