当前位置:网站首页>7.1 simulation summary
7.1 simulation summary
2022-07-02 05:04:00 【Flame*】
Hehe hehe, after two days of looking for a meal card, I finally found
So I didn't lose my meal card I lost my school uniform coat ( Mussel
In fact, today I feel that I still have serious thinking ( Except that I was too sleepy at first
I feel like I have a problem : Too eager to get the right solution Sometimes too lazy to fight troublesome violence
There are two places that are OK today
1.T1 Basically thought about it ( Except that I really don't know how to output the scheme in the end I'm only sure I don't know how to determine the plan )
2.T1 Finally, I want to be lazy and not play the first level of violence But I still wrote it seriously
But I also made a mistake
1.T3 The array is wrong ( Open the array with offset, hehehehehehehehehehehehehehehehehehehehehehehehehehehehehehehehehehehehehehehehehehehehehehehehehehehehehehehehe
2.T1 The paragraph is wrong ) How can anyone judge first n Read it again, hahaha
Angry hang 22 branch It is a pity that
Time arrangement
7.40-9.00
Probably read the question Feeling 23 Have no idea T1 The most feeling Then push carefully T1 Fake a few practices and then react The corresponding way to find points and key points should be : This leaf cannot pass through other key points between the key points
9.00-10.00
There is no progress in thinking about this thing
10.00-10.30
It doesn't feel right So I hit T2 T3 The violence of
10.30-11.00
React suddenly T3 Sure dpdpdpdp
but I don't know How to determine the value of a point I can only find the point corresponding to the leaf I don't know what the point is sad
11.00-12.00
After thinking for a while, I restrained myself I hit T1 Two violence
Topic analysis
T1
consider f [ i , o p ] f[i,op] f[i,op] Express i i i The state in this subtree is o p op op The plan of time
0 Indicates that there are unmatched leaves 1 nonexistence
Need to open a at one point vector Such maintenance
Need to maintain
1. It's with something that forms a transfer
2. Current ∑ v \sum v ∑v
In this way, we can dfs Find all the points You can also maintain the unmatched points Find the leaf corresponding to this point
But how to output the scheme ?
边栏推荐
- 函数中使用sizeof(arr) / sizeof(arr[0])求数组长度不正确的原因
- Simple and practical accounting software, so that accounts can be checked
- Pyflink writes MySQL examples with JDBC
- 培养中小学生对教育机器人的热爱之心
- Use of typescript classes
- Super detailed pycharm tutorial
- Implementation of leetcode two number addition go
- 6.30年终小结,学生时代结束
- 关于Steam 教育的知识整理
- Leetcode basic programming: array
猜你喜欢
关于Steam 教育的知识整理
Knowledge arrangement about steam Education
将光盘中的cda保存到电脑中
Interview question: do you know the difference between deep copy and shallow copy? What is a reference copy?
win10 磁盘管理 压缩卷 无法启动问题
Express logistics quick query method, set the unsigned doc No. to refresh and query automatically
06 decorator mode
Realize the function of data uploading
Typescript function details
Cubemx DMA notes
随机推荐
函数中使用sizeof(arr) / sizeof(arr[0])求数组长度不正确的原因
National all Chinese Automatic Test Software apifox
Oracle和MySQL的基本区别(入门级)
[high speed bus] Introduction to jesd204b
[quick view opencv] familiar with CV matrix operation with image splicing examples (3)
oracle 存储过程与job任务设置
Application d'un robot intelligent dans le domaine de l'agroécologie
Fasttext text text classification
Leetcode basic programming: array
CubeMx DMA笔记
Using Kube bench and Kube hunter to evaluate the risk of kubernetes cluster
DMA Porter
06 decorator mode
Summary of common string processing functions in C language
Promise all()
Lm09 Fisher inverse transform inversion mesh strategy
Go implements leetcode rotation array
What data does the main account of Zhengda Meiou 4 pay attention to?
Oracle stored procedure and job task setting
Feign realizes file uploading and downloading