2020牛客多校第五场

D 环上LIS

#include<bits/stdc++.h>
using namespace std;
int n;
int a[1555],p[1555];
int main(){
    scanf("%d",&n);
    for(int i = 1 ; i <= n ; i ++){
        scanf("%d",&a[i]);
        a[i+n] = a[i];
    }
    int ans = 1000000000;
    for(int i = 1 ; i <= n ; i ++){
        int cnt = 1;
        for(int j=i;j<i+n;j++) p[j] = 1;
        for(int j=i+1;j<i+n;j++){
            for(int k=j-1;k>=i;k--)
                if(a[j]>a[k])
                    p[j] = max(p[j],p[k]+1);
            cnt = max(cnt,p[j]);
        }
        cnt  = n-cnt;
        ans = min(ans,cnt);
    }
    printf("%d\n",ans);
    return 0;
}

E 数论

import math
def gcd(a,b):
    if b==0:
        return a
    else:
        return gcd(b,a%b);
n = int(input())
ans = 1
vis = []
m = pow(10,n)
s = input()
p = [int(n) for n in s.split()]
for i in range(0,n):
    p[i]=p[i]-1;
    vis.append(False)
for i in range(0,n):
    if vis[i] == True:
        continue
    cnt = 1
    t = p[i]
    ti = i
    while t!= ti:
        vis[t] = True
        t = p[t]
        cnt = cnt+1
    ans = ans *cnt//gcd(ans,cnt)%m
print(ans)

F 模拟

/*
* @Author: Admin
* @Date:   2020-07-25 12:18:47
* @Last Modified by:   Admin
* @Last Modified time: 2020-07-25 12:26:46
*/
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef pair<ll, ll> pll;
const int mod = 1e9 + 7;
const int N = 2e5 + 10;
const int INF = 0x3f3f3f3f;
ll qpow(ll base, ll n){ll ans = 1; while (n){if (n & 1) ans = ans * base % mod; base = base * base % mod; n >>= 1;} return ans;}
ll gcd(ll a, ll b){return b ? gcd(b, a % b) : a;}
int d[110];
int main()
{
	int n;
	cin >> n;
	int x = 0;
	for (int i = 1; i <= n; ++ i) {
		scanf("%d", &d[i]);
		x = max(d[i], x);
	}

	for (int i = 1; i <= n; ++ i){
		ll s =   (50*(ll)d[i] + (ll)x - 1 )/ (ll)x ;
		printf ("+");
		for (ll j = 1; j <= s; ++ j) printf("-");
		printf("+\n");
		printf ("|");
		for (ll j = 1; j < s; ++ j) printf(" ");
		if (s != 0)printf("%c", d[i] == x ? '*' : ' ');
		printf("|%d\n", d[i]);
		printf ("+");
		for (ll j = 1; j <= s; ++ j) printf("-");
		printf("+\n");
	}
	return 0;
}

I推结论

#include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define INF 0x3f3f3f3f
#define pi 3.141592654
typedef long long ll;
const int N = 2e6+5;
int main(){
    printf("%.6f\n",2.0/3.0);
    return 0;
}