Redian新闻
>
屋顶5年Warranty有用吗?
avatar
屋顶5年Warranty有用吗?# Living
B*a
1
给定一个数字数组 ,其中每个元素是从末端数小于原数组中该元素的个数。求原数组
。原数组中元素是从 1 到 n。
Example:
原数组 4,1, 3, 2
Count array 3, 0, 1, 0
这题有没有比n^2更快的解法?
avatar
j*8
2
IO said in the very beginning of the ref "The record indicates that the
petitioner has published seven journal articles."......
Close to the end of the ref IO said "The petitioner must establish that the
beneficiary has a past record of specific achievement with come degree of
influence on the field as a whole...the beneficiary's capability to serve
the national interest to a substantial greater extent... For example, the
petitioner may submit copies of patents and copyright, grant proposals, peer
review articles, performance review, any award for work in the field."
My question: Has IO granted that I have 7 publications or I have to submit
new copies to prove further? In my original petition, I submitted only
copies of some of those 7 publications because I didn't have all of them in
hand; and I only translated the abstracts of Chinese articles.
Is it a specific requirement or general citation of an IO?
In the end of the letter, IO said, "if any document is in a foreign language
, it must be submitted along with a certified English Translation..." Does
IO mean that I did not give required translation in my original petition or
IO is warning me that I should submit a certified translation if I submit any Chinese documents in response to the Ref?
Anyone has an idea about this ref?
Thank you in advance for any help!
IO is 1137
avatar
s*e
3
屋顶有些旧,Inspection 后Agant建议Seller提供。这个Warranty包那些?漏雨也包吗
avatar
h*n
4
Can't tell for sure.
Probably use interval tree or segment tree can achieve o(NlogN).
No sure about those either.

【在 B********a 的大作中提到】
: 给定一个数字数组 ,其中每个元素是从末端数小于原数组中该元素的个数。求原数组
: 。原数组中元素是从 1 到 n。
: Example:
: 原数组 4,1, 3, 2
: Count array 3, 0, 1, 0
: 这题有没有比n^2更快的解法?

avatar
j*8
5
a
avatar
n*i
6
warrenty is covered by seller or the roof company?>?
avatar
v*d
7
有一个想法不知道是否可行。
从右到左,建立一个BST。如果在第i步中遇到countArray[i] = k,就把BST分裂成两个
:新建一个父节点,左边是k个元素,右边是i-k个元素。父节点赋值大于左边子树,小
于右边子树(也许值不一定是整数)。顺序记录这些新建节点的值,最后转换成1...n
的值。应该能有O(n*logn)的复杂度吧。
avatar
C*h
8
把所有的文章,每一页都要复印交上去(显然是你之前没有把文章全部材料给齐)。
如果是中文,每一页,每一个字都要翻译一遍,然后去公证一下。

the
peer
submit

【在 j*******8 的大作中提到】
: IO said in the very beginning of the ref "The record indicates that the
: petitioner has published seven journal articles."......
: Close to the end of the ref IO said "The petitioner must establish that the
: beneficiary has a past record of specific achievement with come degree of
: influence on the field as a whole...the beneficiary's capability to serve
: the national interest to a substantial greater extent... For example, the
: petitioner may submit copies of patents and copyright, grant proposals, peer
: review articles, performance review, any award for work in the field."
: My question: Has IO granted that I have 7 publications or I have to submit
: new copies to prove further? In my original petition, I submitted only

avatar
s*e
9
Seller buy it

【在 n******i 的大作中提到】
: warrenty is covered by seller or the roof company?>?
avatar
b*y
10
排序查找
nlogn+n
?

【在 B********a 的大作中提到】
: 给定一个数字数组 ,其中每个元素是从末端数小于原数组中该元素的个数。求原数组
: 。原数组中元素是从 1 到 n。
: Example:
: 原数组 4,1, 3, 2
: Count array 3, 0, 1, 0
: 这题有没有比n^2更快的解法?

avatar
j*8
11
Really? I remember someone said only the first page of the paper. Thank
you.
avatar
h*s
12
自己翻译个英文的abstract。 不用去公证。
avatar
p*a
13
1137 again?
avatar
b*r
14
only the first page. This works at least for me. I applied in Sep. 2010【 在 joyjoy888 (joyjoy888) 的大作中提到: 】
相关阅读
logo
联系我们隐私协议©2024 redian.news
Redian新闻
Redian.news刊载任何文章,不代表同意其说法或描述,仅为提供更多信息,也不构成任何建议。文章信息的合法性及真实性由其作者负责,与Redian.news及其运营公司无关。欢迎投稿,如发现稿件侵权,或作者不愿在本网发表文章,请版权拥有者通知本网处理。