如何确定自己的研究领域？ - 未名空间MITBBS历史存档

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

Redian新闻

>未名空间

>Immigration - 落地生根

如何确定自己的研究领域？

如何确定自己的研究领域？# Immigration - 落地生根

P*b2012-08-14 07:08

1 楼

这道题的最优解怎么解？
There are n gas stations positioned along a circular road. Each has a limite
d supply of gas. You can only drive clockwise around the road. You start wit
h zero gas. Knowing how much gas you need to get from each gas station to th
e next and how much gas you can get at each station, design an algorithm to
find the gas station you need to start at to get all the way around the circ
le.
thanks

w*82012-08-14 07:08

2 楼

我觉得如果从如下ESI-Filed-Rankings里边直接选一个作为自己的研究领域，太广泛，
但如果自己根据自己的研究主题定一个领域，那样很难确定哪些杂志属于这个领域，也
就无
从知道某个杂志在领域内的ranking.大家是如何确定自己的研究领域呢？请教了！谢谢
Field Rankings
Sorted by:
View Field Papers Citations Citations
Per Paper
1 AGRICULTURAL SCIENCES 214,677 1,474,343 6.87
2 BIOLOGY & BIOCHEMISTRY 549,799 8,733,240 15.88
3 CHEMISTRY 1,214,945 13,371,137 11.01
4 CLINICAL MEDICINE 2,133,838 26,023,477 12.20
5 COMPUTER SCIENCE 270,444 1,028,119 3.80
6 ECONOMICS & BUSINESS 173,317 1,060,135 6.12
7 ENGINEERING 857,619 4,044,462 4.72
8 ENVIRONMENT/ECOLOGY 281,947 3,050,601 10.82
9 GEOSCIENCES 292,606 2,678,649 9.15
10 IMMUNOLOGY 121,887 2,444,183 20.05
11 MATERIALS SCIENCE 477,875 3,412,462 7.14
12 MATHEMATICS 271,383 910,479 3.35
13 MICROBIOLOGY 170,864 2,472,082 14.47
14 MOLECULAR BIOLOGY & GENETICS 284,039 6,509,164 22.92
15 MULTIDISCIPLINARY 17,674 122,019 6.90
16 NEUROSCIENCE & BEHAVIOR 300,587 5,391,266 17.94
17 PHARMACOLOGY & TOXICOLOGY 192,867 2,243,048 11.63
18 PHYSICS 937,536 7,679,512 8.19
19 PLANT & ANIMAL SCIENCE 557,124 4,115,473 7.39
20 PSYCHIATRY/PSYCHOLOGY 249,364 2,674,297 10.72
21 SOCIAL SCIENCES, GENERAL 480,633 2,176,429 4.53
22 SPACE SCIENCE 123,292 1,708,966 13.86

g*e2012-08-14 07:08

3 楼

#include
using namespace std;
int selectGasStation(const vector &a, const vector &g) {
int as=0, gs=0;
int net[a.size()];
for(int i=0; ias+=a[i];
gs+=g[i];
net[i]=a[i]-g[i];
}
if(gs>as)
return -1;
int minS[a.size()];
minS[0]=0;
for(int i=1;iminS[i]=minS[i-1]+net[i-1];
minS[0]=minS[a.size()-1]+net[a.size()-1];
int minV=minS[0];
int res=0;
for(int i=1;iif(minS[i]minV=minS[i];
res=i;
}
}
return res;
}

t*12012-08-14 07:08

4 楼

有同样的疑问阿！！！帮顶

a*e2012-08-14 07:08

5 楼

这个答案是从
http://www.itint5.com/discuss/163/%E8%AF%B7%E9%97%AE%E8%BF%99%E
搬运过来的:
任选一个加油站开始，假设其编号为0。
1.如果能走完一圈，问题解决。
2. 如果走到第i个加油站之后，无法走到第i+1个加油站。在这个走法中，从第k（0<=k
<=i）个加油站开始走的时候油箱中的油量是>=0的，但无法走到第i+1个加油站。那么
显然从任意一个加油站k,0<=k<=i,开始，都不能顺利走完。这样我们只需将i+1设为起
点，从头开始尝试。
算法复杂度为O(n)

c*r2012-08-14 07:08

6 楼

找对自己排名最有利的领域。

d*n2012-08-14 07:08

7 楼

A Java Solution:
public int selectGasStation(int[] a, int[] g) {
int start = 0;
int gasLeft = 0;
while(start < a.length) {
int i = 0;
while(i < a.length) {
int curStop = (start + i)%a.length;
gasLeft += a[curStop]-g[curStop];
if (gasLeft < 0) {
if (curStop < start) return -1;
start = Math.min(curStop+1, a.length);
gasLeft =0;
break;
}
i++;
}
if (i == a.length && gasLeft >=0)
return start;
}
return -1;
}

c*w2012-08-14 07:08

8 楼

我po个我的
public int selectGasStation(int[] a, int[] g) {
int want=0, have=0, diff=0, r=0;
for(int i=0;iwant+=g[i];
have+=a[i];
diff+=(a[i]-g[i]);
if(diff<0){
diff=0;
r=i+1;
}
}
if(want>have)
return -1;
return r;
}