递推
文章平均质量分 77
古宇hhhh
一直想着自己的梦
展开
-
uvalive 5092 - Permutation Counting
Given a permutation a1, a2, … aN of {1, 2, … , N}, we define its E-value as the amount of elements where ai > i. For example, the E-value of permutation {1, 3, 2, 4} is 1, while the E-value of {4, 3,原创 2017-01-20 20:17:41 · 303 阅读 · 0 评论 -
hdu 3665 seaside floyd
Seaside Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 955 Accepted Submission(s): 679Problem Description XiaoY is living in a big city,原创 2017-01-20 20:20:08 · 239 阅读 · 0 评论 -
hrbust 2321 Permutation (递推打表)
PermutationTime Limit: 1000 MSMemory Limit: 100000 KTotal Submit: 94(41 users)Total Accepted: 37(36 users)Rating: Special Judge: NoDescription原创 2017-04-29 14:56:17 · 312 阅读 · 0 评论 -
D - Beauty of Array ZOJ - 3872
题意:给你N个数让你求他的连续子序列的和若一个连续子序列中出现重复项就不算。。子序列2 3 3 的值为5eg: 1 2 3dp是从前慢慢往后走的。。。别急啊。。dp[1]=包含 1 :1dp[2]=包含 2 : 2 | 1 2dp[3]=包含 3 : 3 | 2 3 | 1 2 3ans=dp[1]+dp[2]+dp[3];dp[i]=a[i原创 2017-04-30 13:42:14 · 268 阅读 · 0 评论 -
H - May Day Holiday ZOJ - 3876
H - May Day Holiday ZOJ - 3876 题意5.1放5天假,,问你算上周日周六一共几天休假如果是周一放假6 7 1 2 3 4 5 6 7放9天周二放2 3 4 5 6 7放6天#include#includeusing namespace std;int judge(int x){ if(x%400==原创 2017-04-30 13:48:30 · 241 阅读 · 0 评论 -
hdu 6030 Happy Necklace (递推,矩阵快速幂)
Happy NecklaceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 660 Accepted Submission(s): 299Problem DescriptionLittle Q wa原创 2017-08-20 18:51:26 · 804 阅读 · 2 评论 -
hrbust 2309 Another Josephus 约瑟夫环
约瑟夫环int josephus(int n,int x){ if(n==1) return 0; else return (josephus(n-1,x)+x)%n;}就是不断的往下层递归Another JosephusTime Limit: 1000 MSMemory Limit: 13107原创 2017-03-22 21:55:26 · 265 阅读 · 0 评论