
树状数组
ciel_s
这个作者很懒,什么都没留下…
展开
-
LightOJ 1085
All Possible Increasing SubsequencesTime Limit: 3000MS Memory Limit: 65536KB 64bit IO Format: %lld & %lluDescription An increasing subsequence from a sequence A1, A2 … An is defined by Ai1原创 2016-10-09 20:14:46 · 293 阅读 · 0 评论 -
poj 1990 MooFest (树状数组)
MooFestTime Limit: 1000MS Memory Limit: 30000KDescription Every year, Farmer John’s N (1 <= N <= 20,000) cows attend “MooFest”,a social gathering of cows from around the world. MooFest involves原创 2016-10-16 18:34:36 · 341 阅读 · 0 评论