g*z
2 楼
大家寄钱回国,
(1) 如果用电汇或支票的话,家人拿到手还是美金吧,如果要去银行兑换成人民币,
还有一笔费用吧?
(2) 如果用BOA卡在国内建行直接取现,取出来是人民币,而且好象手续费也不高。
如果是转5000美元以下,是哪个更划得来呢?
如果是转5000美元以上呢?
谢谢!
(1) 如果用电汇或支票的话,家人拿到手还是美金吧,如果要去银行兑换成人民币,
还有一笔费用吧?
(2) 如果用BOA卡在国内建行直接取现,取出来是人民币,而且好象手续费也不高。
如果是转5000美元以下,是哪个更划得来呢?
如果是转5000美元以上呢?
谢谢!
i*1
3 楼
25G space, 100M single file limit,
放一些MV, 自拍的照片,小视频正好。。。
可以直接看也可以下载
放一些MV, 自拍的照片,小视频正好。。。
可以直接看也可以下载
m*f
4 楼
topcoder题目? 不是有别人做的代码可以看吗
s*o
6 楼
upload is one by one ah...
g*y
10 楼
假设子问题针对第1号到第i号(前i个人),但是首尾不相连(1号和i号不是邻居):
需要知道子问题里第i号是否要donate
当做到最后一个人(第n号)的时候,因为最后一个人既跟n-1号人,又跟1号相邻,那么就需要知道子问题里面第1号人是否donate
也就是说,子问题的state需要几个参数:
1个bit来表示第一个人是否donate
1个bit来表示最后一个人是否donate
1个int i来表示从1号到第i号人的子问题
也就是说,用一个数组:
a[2][2][n]来保存每个子问题的解。
定义好子问题后,写出状态转移方程,然后一直算到倒数第二个人结束。第n个人单独处理一下
需要知道子问题里第i号是否要donate
当做到最后一个人(第n号)的时候,因为最后一个人既跟n-1号人,又跟1号相邻,那么就需要知道子问题里面第1号人是否donate
也就是说,子问题的state需要几个参数:
1个bit来表示第一个人是否donate
1个bit来表示最后一个人是否donate
1个int i来表示从1号到第i号人的子问题
也就是说,用一个数组:
a[2][2][n]来保存每个子问题的解。
定义好子问题后,写出状态转移方程,然后一直算到倒数第二个人结束。第n个人单独处理一下
j*u
11 楼
请问BOA电汇到建行,怎么收费
d【 在 TaurusFeifei (zhuzhu) 的大作中提到: 】
d【 在 TaurusFeifei (zhuzhu) 的大作中提到: 】
n*s
13 楼
just wake up and consider it again:
Trying to solve it in this way:
original problem: a1, a2, ....ai, ...an-1, an
subproblem : a1, a2, ... ai
Define array: L[2][n]
L[0][i] --> the max donation where the ith neighbor won't donate
L[1][i] -->the max donation where the ith neighbor will donate
Recursive relation:
L[0][i+1] = max {L[0][i], L[1][i]}
L[1][i+1] = L[0][i] + a[i]
However, during this extension, we don't consider the head/tail collision, but this will be problem. So at the final st
Trying to solve it in this way:
original problem: a1, a2, ....ai, ...an-1, an
subproblem : a1, a2, ... ai
Define array: L[2][n]
L[0][i] --> the max donation where the ith neighbor won't donate
L[1][i] -->the max donation where the ith neighbor will donate
Recursive relation:
L[0][i+1] = max {L[0][i], L[1][i]}
L[1][i+1] = L[0][i] + a[i]
However, during this extension, we don't consider the head/tail collision, but this will be problem. So at the final st
g*y
15 楼
how about
note: inf = infinity
numbers: inf, inf/2,.....10,inf*0.75
all your L[0][] L[1][] will select the first number:"inf"
when it comes to the last number "inf*0.75":
which number to sacrifice?
obviously the answer should abandon the first "inf", but if you abandon the first number, your L[][] result will become useless
this is exactly what I meant in my post:
You don't define a "state"(i.e,subproblem) well enough if you don't specify whether the first number is chosen or not.
【在 n*******s 的大作中提到】![](/moin_static193/solenoid/img/up.png)
: just wake up and consider it again:
: Trying to solve it in this way:
: original problem: a1, a2, ....ai, ...an-1, an
: subproblem : a1, a2, ... ai
: Define array: L[2][n]
: L[0][i] --> the max donation where the ith neighbor won't donate
: L[1][i] -->the max donation where the ith neighbor will donate
: Recursive relation:
: L[0][i+1] = max {L[0][i], L[1][i]}
: L[1][i+1] = L[0][i] + a[i]
note: inf = infinity
numbers: inf, inf/2,.....10,inf*0.75
all your L[0][] L[1][] will select the first number:"inf"
when it comes to the last number "inf*0.75":
which number to sacrifice?
obviously the answer should abandon the first "inf", but if you abandon the first number, your L[][] result will become useless
this is exactly what I meant in my post:
You don't define a "state"(i.e,subproblem) well enough if you don't specify whether the first number is chosen or not.
【在 n*******s 的大作中提到】
![](/moin_static193/solenoid/img/up.png)
: just wake up and consider it again:
: Trying to solve it in this way:
: original problem: a1, a2, ....ai, ...an-1, an
: subproblem : a1, a2, ... ai
: Define array: L[2][n]
: L[0][i] --> the max donation where the ith neighbor won't donate
: L[1][i] -->the max donation where the ith neighbor will donate
: Recursive relation:
: L[0][i+1] = max {L[0][i], L[1][i]}
: L[1][i+1] = L[0][i] + a[i]
n*s
17 楼
l's inital value would be
L[0][0] = 0
L[1][0] = a[0]
since, L[0][i] means the possible max if the ith does not donate
L[1][i] means the possible max if the ith does donate
Here is the code:
int a[] = { 94, 40, 49, 65, 21, 21, 106, 80, 92, 81, 679, 4, 61, 6, 237
, 12, 72, 74, 29, 95, 265, 35, 47, 1, 61, 397, 52, 72, 37, 51, 1, 81, 45,
435, 7, 36, 57, 86, 81, 72 };
int size = sizeof(a)/sizeof(int);
int l[2][size];
int m[size];
int type=0;
int i =0, j=0, max=0;
m
L[0][0] = 0
L[1][0] = a[0]
since, L[0][i] means the possible max if the ith does not donate
L[1][i] means the possible max if the ith does donate
Here is the code:
int a[] = { 94, 40, 49, 65, 21, 21, 106, 80, 92, 81, 679, 4, 61, 6, 237
, 12, 72, 74, 29, 95, 265, 35, 47, 1, 61, 397, 52, 72, 37, 51, 1, 81, 45,
435, 7, 36, 57, 86, 81, 72 };
int size = sizeof(a)/sizeof(int);
int l[2][size];
int m[size];
int type=0;
int i =0, j=0, max=0;
m
g*y
19 楼
have you tried my test case?
inf, inf*0.5, ...(normal numbers),inf*0.7
you can use 9999999 as inf.
237
【在 n*******s 的大作中提到】![](/moin_static193/solenoid/img/up.png)
: l's inital value would be
: L[0][0] = 0
: L[1][0] = a[0]
: since, L[0][i] means the possible max if the ith does not donate
: L[1][i] means the possible max if the ith does donate
: Here is the code:
: int a[] = { 94, 40, 49, 65, 21, 21, 106, 80, 92, 81, 679, 4, 61, 6, 237
: , 12, 72, 74, 29, 95, 265, 35, 47, 1, 61, 397, 52, 72, 37, 51, 1, 81, 45,
: 435, 7, 36, 57, 86, 81, 72 };
: int size = sizeof(a)/sizeof(int);
inf, inf*0.5, ...(normal numbers),inf*0.7
you can use 9999999 as inf.
237
【在 n*******s 的大作中提到】
![](/moin_static193/solenoid/img/up.png)
: l's inital value would be
: L[0][0] = 0
: L[1][0] = a[0]
: since, L[0][i] means the possible max if the ith does not donate
: L[1][i] means the possible max if the ith does donate
: Here is the code:
: int a[] = { 94, 40, 49, 65, 21, 21, 106, 80, 92, 81, 679, 4, 61, 6, 237
: , 12, 72, 74, 29, 95, 265, 35, 47, 1, 61, 397, 52, 72, 37, 51, 1, 81, 45,
: 435, 7, 36, 57, 86, 81, 72 };
: int size = sizeof(a)/sizeof(int);
相关阅读
请问att next的plan我机子只要不激活就一直没开始plan么?也许该等iPod Touch+VERIZON全价机咨询verizon店买全价机6+要几点去排队啊?Ios8 control center 太难看了吧Iphone 6+ 在AMAZON开卖了,$1,722.00 + $10.49 shipping (转载)新手想入手iphone6,有些问题apple卖的t-mobile 全价机无锁对比一下几大卖ip6的地方,果子店最不厚道ios8里面找不到照片流了有没有去tmobile trade-in iPhone 4的?确认信息。apple。com预定的tmobile,no contract插上ATT sim为啥 iphone5没 sim 卡也可以接电话?昨天升级最后一个IPHONE悲剧了In-store pickupapple watch的根本意思在于改变人类的生活方式t mobile的trade in programmini ipad能接外置键盘吗?苹果店门口排了三个人发现大多在美国待久的WSN/WSNV已经猥琐到极点了