ICPC
文章平均质量分 77
lzy333221
这个作者很懒,什么都没留下…
展开
-
soj1041. Pushing Boxes
#include #include #include #include #include #include #define maxn 210001 using namespace std; int N,M,K; int a[maxn],sa[maxn],rank[maxn],height[maxn]; int wb[maxn],wv[maxn],sw[maxn],wa[maxn],b[maxn],原创 2015-04-15 21:14:09 · 366 阅读 · 0 评论 -
三维偏序
太神奇的,二分的魅力 给定N个没有顺序三元组(xi,yi,zi),求其中能构成最长上升序列的长度,大于的定义为(xi>xj && yi>yj && zi>zi) 1.在处理区间[L,R]的时候,先二分区间[L, (L+R)/ 2],递归求这个左区间(二分的原因是我在维护y维的时候难免破坏x维的性质,但是二分之后我还是可以保证左区间的x全都大于右区间的x)。 (注意对x排序的时候,如果转载 2015-01-29 23:45:42 · 416 阅读 · 0 评论 -
soj1005. Roll Playing Games
1005. Roll Playing Games Constraints Time Limit: 1 secs, Memory Limit: 32 MB Description Phil Kropotnik is a game maker, and one common problem he runs into is determining the s原创 2014-12-30 23:12:40 · 693 阅读 · 0 评论 -
soj1003. Hit or Miss
1003. Hit or Miss Constraints Time Limit: 1 secs, Memory Limit: 32 MB Description One very simple type of solitaire game known as "Hit or Miss" (also known as "Frustration," "Harvest,"原创 2014-09-04 22:21:24 · 542 阅读 · 0 评论 -
soj1002 Anti-prime Sequences
1002. Anti-prime Sequences Constraints Time Limit: 3 secs, Memory Limit: 32 MB Description Given a sequence of consecutive integers n,n+1,n+2,...,m, an anti-prime sequence is a rear原创 2014-09-03 23:38:15 · 923 阅读 · 0 评论 -
soj1001. Alphacode简单动规
Constraints Time Limit: 1 secs, Memory Limit: 32 MB Description Alice and Bob need to send secret messages to each other and are discussing ways to encode their messages: Alice: "Let's just us原创 2014-08-30 23:29:20 · 486 阅读 · 0 评论 -
soj1000a-b(高精度)
开始soj了 第一题1000 与众不同的居然是a-b原创 2014-08-30 13:36:52 · 299 阅读 · 0 评论