暑假刷题第一天---7/9

112. 雷达设备 - AcWing题库（贪心）

#include<iostream>
#include<queue>
#include<algorithm>
#include<cmath>
using namespace std;
pair<double,double>a[1005];
int main(){
    int n;
	double d;
	cin>>n>>d;
	int f=1;
	for(int i=0;i<n;i++){
		double q,w;
		cin>>q>>w;
		if(w>d)f=0;
		a[i].first=q-sqrt(d*d-w*w);
		a[i].second=q+sqrt(d*d-w*w);
	}
	if(f==0){
		cout<<-1<<endl;
		return 0;
	}
	sort(a,a+n);
	int ans=1;
	double k=a[0].second;
	for(int i=1;i<n;i++){
		if(a[i].first>=k){
			k=a[i].second;
			ans++;
		}
	}
	cout<<ans<<endl;
}

Problem - B - Codeforces（贪心、位运算）

#include<iostream>
#include<string>
#include<cstring>
#include<algorithm>
using namespace std;
int a[10005];
void solve(){
	int n,k;
	cin>>n>>k;
	int ans=0;
	for(int i=0;i<3;i++){
		int f=1;
		for(int j=0;j<n;j++){
			int q;
			cin>>q;
			if(f==1&&k==(k|q)){
				ans=ans|q;
			}
			else f=0;
		}
	}
	if(ans==k)cout<<"Yes"<<endl;
	else cout<<"No"<<endl;
}
int main(){
	int t;
	cin>>t;
	while(t--){
		solve();
	}
} 

Problem - C - Codeforces（dp）

#include<iostream>
#include<cstring>
#include<vector>
using namespace std;
using LL = long long;

int main(){

    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);

    const int INF = 1e9;
    int T;
    cin >> T;
    while(T--){
        int n;
        cin >> n;
        vector<int> a(n + 1);
        for(int i = 1; i <= n; i++) cin >> a[i];
        vector<int> dp(n + 1);
        vector<int> mx(n + 1, -INF);
        for(int i = 1; i <= n; i++){
            dp[i] = dp[i - 1];
            dp[i] = max(dp[i], i + mx[a[i]]);
            mx[a[i]] = max(mx[a[i]], dp[i - 1] - (i - 1)); 
        }
        cout << dp.back() << '\n';
    }

}

4742. 电 - AcWing题库（记忆化搜索）

#include<iostream>
#include<cstring>

using namespace std;

const int N = 2e5 + 10, M = 2 * N;

int w[N], T, n, f[N];
int h[N], ne[M], e[M], idx;
bool st[N];

void add(int a, int b)
{
    e[idx] = b, ne[idx] = h[a], h[a] = idx++;
}

int dfs(int u)
{
    int &v = f[u];
    if(v != -1) return v;
    f[u] = 1;

    for(int i = h[u]; i != -1; i = ne[i])
    {
        int j = e[i];
        if(w[u] > w[j]) 
        {
            dfs(j);
            f[u] += f[j];
        }
    }
    return v;
}

int main()
{
    cin >> T;
    for(int t = 1; t <= T; t++)
    {
        memset(h, -1, sizeof h);
        idx = 0;
        scanf("%d", &n);
        for(int i = 1; i <= n; i++) scanf("%d", &w[i]);

        for(int i = 1; i < n; i++)
        {
            int a, b;
            scanf("%d%d", &a, &b);
            add(a, b);
            add(b, a);
        }

        int res = 1;
        memset(f, -1 ,sizeof f);
        for(int i = 1; i <= n; i++)
            res = max(res, dfs(i));

        printf("Case #%d: %d\n", t, res);
    }

    return 0;
}