当前位置:网站首页>Acwing第 58 场周赛【完结】
Acwing第 58 场周赛【完结】
2022-07-05 02:37:00 【辉小歌】
没打,赛后vp了一下题目好简单。
15min做完
https://www.acwing.com/activity/content/competition/problem_list/1994/、
4488. 寻找1【签到】
#include<bits/stdc++.h>
using namespace std;
int main(void)
{
int n,x,flag=0;
cin>>n;
while(n--)
{
cin>>x;
if(x) flag=1;
}
if(flag) puts("YES");
else puts("NO");
return 0;
}
4489. 最长子序列【贪心 / 双指针】
#include<bits/stdc++.h>
using namespace std;
const int N=1e5*3+10;
int n,a[N];
int main(void)
{
cin>>n;
for(int i=1;i<=n;i++) cin>>a[i];
int cnt=1,last=1,ans=1;
for(int i=2;i<=n;i++)
{
if(a[i]<=a[last]*2) cnt++,last=i;
else last=i,cnt=1;
ans=max(ans,cnt);
}
cout<<ans;
return 0;
}
4490. 染色【思维】
画图,你会发现只要其颜色和父亲颜色不一样就加1.
#include<bits/stdc++.h>
using namespace std;
const int N=1e5*3+10;
int h[N],e[N],ne[N],idx;
int w[N],n,cnt=1;
void add(int a,int b)
{
e[idx]=b,ne[idx]=h[a],h[a]=idx++;
}
void dfs(int u,int fa)
{
if(fa!=-1&&w[u]!=w[fa]) cnt++;
for(int i=h[u];i!=-1;i=ne[i])
{
int j=e[i];
if(j==fa) continue;
dfs(j,u);
}
}
int main(void)
{
memset(h,-1,sizeof h);
cin>>n;
for(int i=2;i<=n;i++)
{
int x; cin>>x;
add(x,i),add(i,x);
}
for(int i=1;i<=n;i++) cin>>w[i];
dfs(1,-1);
cout<<cnt;
return 0;
}
边栏推荐
- Prometheus monitors the correct posture of redis cluster
- Asynchronous and promise
- ASP. Net core 6 framework unveiling example demonstration [01]: initial programming experience
- The MySQL team development specifications used by various factories are too detailed. It is recommended to collect them!
- LeetCode --- 1071. Great common divisor of strings problem solving Report
- openresty ngx_ Lua variable operation
- Hmi-30- [motion mode] the module on the right side of the instrument starts to write
- Yolov5 model training and detection
- Chinese natural language processing, medical, legal and other public data sets, sorting and sharing
- [技术发展-26]:新型信息与通信网络的数据安全
猜你喜欢
Pytest (5) - assertion
Chinese natural language processing, medical, legal and other public data sets, sorting and sharing
Open source SPL optimized report application coping endlessly
spoon插入更新oracle数据库,插了一部分提示报错Assertion botch: negative time
Application and Optimization Practice of redis in vivo push platform
【LeetCode】110. Balanced binary tree (2 brushes of wrong questions)
Elk log analysis system
Design and practice of kubernetes cluster and application monitoring scheme
Naacl 2021 | contrastive learning sweeping text clustering task
Problem solving: attributeerror: 'nonetype' object has no attribute 'append‘
随机推荐
Serious bugs with lifted/nullable conversions from int, allowing conversion from decimal
【LeetCode】222. The number of nodes of a complete binary tree (2 mistakes)
Can you really learn 3DMAX modeling by self-study?
172. Zero after factorial
Bumblebee: build, deliver, and run ebpf programs smoothly like silk
Asynchronous and promise
[technology development-26]: data security of new information and communication networks
[200 opencv routines] 99 Modified alpha mean filter
GFS分布式文件系统
Design and implementation of campus epidemic prevention and control system based on SSM
Day_ 17 IO stream file class
When the low alcohol race track enters the reshuffle period, how can the new brand break the three major problems?
Structure of ViewModel
Visual explanation of Newton iteration method
Bert fine tuning skills experiment
openresty ngx_ Lua variable operation
返回二叉树中两个节点的最低公共祖先
[source code attached] Intelligent Recommendation System Based on knowledge map -sylvie rabbit
Variables in postman
Practical case of SQL optimization: speed up your database