![](https://img-blog.csdnimg.cn/20201014180756738.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
------其他
_zhj
加油!
展开
-
HDU5944
HDU5944原创 2017-05-12 16:15:50 · 1141 阅读 · 0 评论 -
HDU5908Abelian Period
Abelian Period Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/131072 K (Java/Others) Problem Description Let S be a number string, and occ(S,x) means the times that numb原创 2017-05-16 19:58:26 · 190 阅读 · 0 评论 -
HDU4982 Goffi and Squary Partition
Goffi and Squary Partition Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Problem Description Recently, Goffi is interested in squary partition of integ原创 2017-06-05 21:24:40 · 261 阅读 · 0 评论 -
HDU6029 Graph Theory
Graph Theory Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 477 Accepted Submission(s): 229 Problem Description Little Q love原创 2017-06-29 17:10:53 · 450 阅读 · 0 评论 -
HDU 5056 Boring count(滑动窗口)
Boring count Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1641 Accepted Submission(s): 601 Problem Description You are given原创 2017-08-20 16:13:01 · 229 阅读 · 0 评论 -
图的存在性
题目: 给定过一个1到N的排列P1到PN,请判断是否存在一个由N个点,N-1条边组成的无向连通图,满足对于任意两个整数i和j(i不等于j),若第i个点和第j个点之间有边相连,则第Pi个点和第Pj个点之间同样有边相连。 输入: 第一行输入一个整数T表示T组数据, 每组数据格式为: 第一行包括一个整数N, 第二行包含N个整数Pi到PN 输出: 每组输出一行,如果存在满足条件的图则输出Yes,否...原创 2019-09-24 22:17:59 · 902 阅读 · 2 评论