想买origins的面膜，哪里有deal - 未名空间MITBBS历史存档

国际科技财经博客移民网络热点娱乐民生时事公众号

Redian新闻

>未名空间

>Fashion - 美丽时尚

想买origins的面膜，哪里有deal

想买origins的面膜，哪里有deal# Fashion - 美丽时尚

t*y2011-03-10 08:03

1 楼

given a text file and a list of string, find the max length of strings that
combined from the given list
of string in the text file. Each character in the given list of string can
be used only once.
ANS: A list contains all possible prefix strings up to x.

d*g2011-03-10 08:03

2 楼

想买保湿的，有人推荐origins的，想买来试试，不知道最近哪里有deal？

S*s2011-03-10 08:03

3 楼

能举个例子么？

h*22011-03-10 08:03

4 楼

Origins - free moisturizer of your choice with any skincare purchase + free
shipping with any order, Mar 18
Origins is offering free shipping on any order. Plus, with any skincare
purchase, receive a free three week supply (0.5 oz) of the moisturizer of
your choice. All codes expire March 27 or while supplies last.
•for A Perfect World SPF 25 enter code PERFECT
•for Brighter by Nature enter code BRIGHT
•for Starting Over enter code START
•for Youthtopia enter code YOUTH

k*z2011-03-10 08:03

5 楼

对的，没有例子这个描述很模糊啊

n*a2011-03-10 08:03

6 楼

这个收藏。。我正在到处找面膜和眼膜呢。
呵呵。

free

【在 h**********2 的大作中提到】

: Origins - free moisturizer of your choice with any skincare purchase + free
: shipping with any order, Mar 18
: Origins is offering free shipping on any order. Plus, with any skincare
: purchase, receive a free three week supply (0.5 oz) of the moisturizer of
: your choice. All codes expire March 27 or while supplies last.
: •for A Perfect World SPF 25 enter code PERFECT
: •for Brighter by Nature enter code BRIGHT
: •for Starting Over enter code START
: •for Youthtopia enter code YOUTH

h*c2011-03-10 08:03

7 楼

It looks like it is asking a word without repeating characters.
Opinion,
If it is chinese/hindi text, could be quite troublesome.

h*s2011-03-10 08:03

8 楼

- The strings should be concatenated sequentially or mixing is allowed? -
- What does "up to x" mean?
"ANS: A list contains all possible prefix strings up to x. "
楼主能给个例子吗？

t*y2011-03-10 08:03

9 楼

我的理解是给一个dictionary, 一个string,找出dict 里能全部用string里的letter
表示的所有最长的词

【在 h***s 的大作中提到】

: - The strings should be concatenated sequentially or mixing is allowed? -
: - What does "up to x" mean?
: "ANS: A list contains all possible prefix strings up to x. "
: 楼主能给个例子吗？

i*o2011-03-10 08:03

10 楼

sounds like knapsack variants:
text file is the capacity of letters
each string in the given list consumes some letter
there is no limit on the number of single string
it should use letter set to account capacity and consumption in dp
struct letter_set {
int l[26]; /* count of distinct letters */
} text_file, strings[N];
max{X(text_file - strings[i]) + 1|i=0...N-1}