Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
 Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register

隐隐觉得是一道数学题，憋了一个周也没有头绪，只好仿照别人的DP思路了

Posted by lddlinan at 2020-11-21 12:50:27 on Problem 1638 
1. key是当前的数组，排序的，不含素数，不含1，这样key的最大长度是9，4**9
2. 用trie[n][12]来存储dp的值，比如[123,456]对应的trie的序列是 1,2,3,10,4,5,6

比不上0ms的大神，这样也挺快的
Followed by:
Post your reply here:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator