不同种类花的英语

Posted 2023-05-09

额，我说的是花的英语，比如说rose，lily什么的。。。。

1、daisy　

读音：英 ['deɪzi] 　美 ['deɪzi] 　 　

n. 雏菊；菊科植物；<俚>极好的东西；[大写]黛西(女子名)

I prefer the daisy and the knapweed in particular.

我特别喜欢雏菊和矢车菊。

2、gardenia　

读音：英 [ɡɑː'diːniə]  美 [ɡɑːr'diːniə] 　 　

n. 栀子花；栀子

The writer alwalys received a gardenia every day in summer from child to adult.

作者从小到大每到夏天每天都会收到一支栀子花。

3、jasmine　

读音：英 ['dʒæzmɪn] 美 ['dʒæzmɪn] 　 　

n. 茉莉；淡黄色

A faint perfume of jasmine came through the window.

从窗户外飘进一阵淡淡的茉莉花香。

4、peony　

读音：英 ['piːəni]  美 ['piːəni] 　 　

n. 芍药；牡丹

The peonies are in full bloom now.

现在牡丹花正盛开。

5、tulip　 

读音：英 ['tjuːlɪp]   美 ['tuːlɪp] 　 　

n. 郁金香

Tulip show the perfection of our love.

郁金香象征我俩完美的爱情。

参考技术A 中国水仙 new year lily 石榴 pomegranate 月桂victor\'s laurel 报春花 polyanthus 木棉 cotton tree 紫丁香 lilac 吊钟 lady\'s eardrops 紫荆 chinese redbud 百合 lily 紫罗兰 wall flower 桃花 peach 紫藤 wistaria 杜鹃 azalea 铃兰 lily-of-the-valley 牡丹 tree paeony 银杏 ginkgo 芍药 paeony 蝴蝶兰 moth orchid 辛夷 violet magnolia 蟹爪仙人掌 christmas cactus 玫瑰 rose 郁金香 tulip 茶花 common camelia 千日红 common globe-amaranth 非洲堇 african vioet 天人菊 indian blanket 栀子花 cape jasmine 木槿 rose of sharon 风信子 hyacinyh 百子莲 african lily 牵牛花 morning glory 君子兰 kafir lily 荷包花 lady\'s pocketbook 含笑花 banana shrub 非洲菊 african daisy 含羞草 esnsitive plant 茉莉 arabian jasmine 猪笼草 pitcher plant 凌霄花 creeper 树兰 orchid tree 康乃馨caronation 鸡冠花 cockscomb 荷花lotus 鸢萝 cypress vine 菩提 bo-tree 大理花 dahlia 圣诞百合 christmas bell 一串红 scarlet sage 紫薇 crape myrtle 勿忘草 forget-me-not 睡莲 water lily 文心兰 dacing lady 吊兰 spider plant 白头翁 pappy anemone 向日葵 sunflower 矢车菊 cornflower 竹 bamboo 金鱼草 snapdrgon 夹竹桃 oleander 金盏花 pot marigold 扶桑 china rose 金银花 japanese honeysuckle 长春花 old maid 金莲花 garden nasturium 秋海棠begonia 非洲凤仙 african touch-me-not 美人蕉 canna 曼佗罗 angel\'s trumpet 晚香玉 tuberose 梅花 flowering apricot 野姜花 ginger lily 圣诞红 common poinsettia 菊花 chrysamthemum 虞美人 iceland poppy 昙花 epiphyllum 鸢尾 iris 龙胆 royal blue 腊梅 winter sweet 麒麟花 bojers spurge 木芙蓉 cotton rose 九重葛 paper flower 火鹤花 flamingo flower 三色堇 tricolor viola 嘉德丽亚兰 cattleya本回答被提问者采纳 参考技术B azalea 杜鹃花
begonia 秋海棠
Brazil 巴西木
cactus 仙人掌
camellia 山茶花
carnation 麝香石竹(康乃馨)
Chinese enkianthus 灯笼花
Chinese flowering crab-apple 海棠花
chrysanthemum 菊花
dahlia 大丽花
daisy 雏菊
datura 曼陀罗
epiphyllum 昙花
fringed iris 蝴蝶花
fuchsia 倒挂金钟
gardenia 栀子
India canna 美人蕉
jasmine 茉莉
lilac 丁香
lily 百合
mangnolia 木兰花
mangnolia 玉兰花
morning glory 牵牛(喇叭花)
narcissus 水仙花
oleander 夹竹桃
orchid 兰花
pansy 三色堇
peony 牡丹
peony 芍药
phalaenopsis 蝶兰
rose 玫瑰
rose 月季
setose asparagus 文竹
touch-me-not (balsam) 凤仙花
tulip 郁金香
violet, stock violet 紫罗兰
water hyacinth 凤眼兰 参考技术C Tomorrow, 2011 ashore January 2, I grew up, yet, I do not understand I was brought up, matured! Actually, I ought be brought up, should mature, do not know why, why am I put no fewer than immature ego, put no fewer than width no big oneself, put no fewer than immature associate with, cannot face reality! I know, reality is how absolutely affection, it is me too babyish, what still knowing is a fact. If be reality,Louis Vuitton Outlet, so,Hermes Handbags, inside always reality, who is the actualest. I fair know, tin do, had done, tin some consideration, afresh some extra, it is needless, it is multifarious, still write down days is hurriedly! Saying is Shao Hua, still not be an instant as ahead! Think self-confidently to be capable apt have win time without the human, yeah, without the person, so, imperceptible, I lost period! Say, time can forget a paragraph of sensibility; Say, start a paragraph of current sentiment, can forget a paragraph of melancholy associate with; Say, want to forget merely, tight tight ground can forget hard; Say, detest him to be able to forget him. But, missay, time did not let me forget, new sentiment did not let me forget, firm firm did not let me forget hard, dislike likewise did not let me forget! I am trashy, I am not done, I put myself in the maximum low-down rank. You look me always is the posture with look down at. And you. . It is my heart middling friend, alternatively it is a bosom friend return or. . . You always have a lot of reason, and I always am be unable to advance whichever beyond arguments to justify ego whatever, or choice is silent. Perhaps, be like a libretto inside a anthem; sees you no longer you just can reminisce me. Who does must be able to memorize once having when I leave quite silly goofy, once was inverse I am very nice. Perhaps, I am a passing traveller only. Why we do less than resembling favor plain boiled water pure, approximate juice however same illuminative is so bright-coloured. The person has too much fault, however cannot consciousness. What to importune, can approximate a the simplest friend same, give me a morsel touch solace, a morsel extra very few, this is ample, can not be so chilly, chilly can let me come with wine only him attentive namely 1000 sore the heart of 100 hole, I am very weary truly, very sad really, want to mention with you really, do not have statute and you to say anew however really! Present oneself, inactive too go what striving because, I too do not want what to aspire as. Be understood, not be a friend, it is so such, who is irrecoverable oneself center, because of a person, desertioned the heart, how can work behind afresh, the hope is desperate still, do not have despair without the hope, so, whether be to cede hoping, whose meeting can accede! Wait for a hour, await an daytime, wait for a month, arrive one annual again,LV Bags, arrive 3 years 5 years again, while the person that wait is plunged into was in in the heart, the following oneself, challenge still love? The following oneself, still can courage loves? Have some of person, some entities, resembling is to get you face of in one's heart, also pedal always do not go, brush do not drip! When you know me, I do not know you, while you like me, I know you, when you catch on me, I like you, when you leave me, I catch on you. Come 3 years, I cannot say I still am waiting, just say I forget to be not dropped, do not put, put no less than that immature love. I present,Louis Vuitton Handbags, be brought up, maturing, learning independence. But, I or appointment are sad, the meeting is sad. I know, you can muse such statement, very immature. Very artificial,prada handbags! I also feel good vacation is very false, if all distress, bitter, failure is false, are this much then better? Regrettablly, there are a lot of hypocrisies ashore the globe, oneself suffering, failure, sad, always be true unluckily however. Just, I continue to be brought up even, continue to mature. . . . . .

Related themes article：

Heart of concealed body, concealed_1386

Forgot love to cannot forget you_174

Foolish stupid girl is stupid foolish dream_2362

His love, her otherwise rises_800

Gaze at affectionately_2667 参考技术D rose ,玫瑰，lily 百合, peach flower 桃、peony 牡丹、redbud紫荆、clove丁香、wistaria紫藤、
azalea 杜鹃花、megranate 石榴花、jasmine茉莉花、gardenia 栀子花 sweet-scented osmanthus 桂花、lotus 芙蓉 calyx canthus 腊梅、camellia 山茶花、

小奇的花园

【问题描述】
小奇的花园有 n 个温室,标号为 1 到 n,温室以及以及温室间的双向道路形成一
棵树。
每个温室都种植着一种花,随着季节的变换,温室里的花的种类也在不断发生着
变化。
小奇想知道从温室 x 走到温室 y 的路径中(包括两个端点),第 t 种花出现的次数。
【输入格式】
第一行为两个整数 n,q,表示温室的数目和操作的数目。
第二行有 n 个整数 T 1 ,T 2 ...T n 其中 T i 表示温室 i 中的花的种类。接下来 n-1 行,每个两个整数 x, y,表示温室 x 和 y 之间有一条双向道路。
接下来 q 行,表示 q 个操作,分别为以下两种形式之一:
• C x t 表示在温室 x 中的花的种类变为 t。
• Q x y t 表示询问温室 x 走到温室 y 的路径中(包括两个端点),第 t 种花出现
的次数。
为了体现在线操作,输入数据中的每个操作的参数都进行了加密。记最后一次询
问的答案为 anslast(一开始设 anslast 为 0),下次读入中的 x,y,t 均需要异或上
anslast 以得到真实值,在 C/C++中异或为ˆ运算符,在 pascal 中为 xor 运算符。
【输出格式】
输出 q 行,每行一个正整数表示该次询问答案。
【样例输入】
5 8
10 20 30 40 50
1 2
1 3
3 4
3 5
Q 2 5 10
C 2 21
Q 3 4 21
C 6 22
Q 1 7 28
C 5 20
Q 2 5 20
Q 2 0 9
【样例输出】
1
2
0
3
1
【样例解释】
加密前的操作:
Q 2 5 10
C 3 20
Q 2 5 20
C 4 20
Q 3 5 30
C 5 20
Q 2 5 20Q 1 3 10
【数据范围】
对于 30%的数据,有 n <= 1000, q <= 2000。
对于 50%的数据,有 n <= 10000, q <= 20000。
对于 100%的数据,有 n <= 100000, q <= 200000,0 <= T <= 2^31。

树链剖分

对于每一种颜色建一棵线段树，动态开点

颜色用map离散，最多300000种颜色

动态开店用内存池防止内存超限

  1 #include<iostream>
  2 #include<cstdio>
  3 #include<cstring>
  4 #include<algorithm>
  5 #include<cmath>
  6 #include<map>
  7 #include<queue>
  8 using namespace std;
  9 struct Node
 10 {
 11   int next,to;
 12 }edge[200001];
 13 queue<int>Q;
 14 int num,head[100001],pos,tot,cnt,dep[100001],fa[100001],size[100001],son[100001];
 15 int top[100001],dfn[100001],root[300001],t[300001],ans,c[10000001],ch[10000001][2],n,q;
 16 map<int,int>mp;
 17 void add(int u,int v)
 18 {
 19   num++;
 20   edge[num].next=head[u];
 21   head[u]=num;
 22   edge[num].to=v;
 23 }
 24 void dfs1(int x,int pa)
 25 {int i;
 26   dep[x]=dep[pa]+1;
 27   fa[x]=pa;
 28   size[x]=1;
 29   for (i=head[x];i;i=edge[i].next)
 30     {
 31       int v=edge[i].to;
 32       if (v==pa) continue;
 33       dfs1(v,x);
 34       size[x]+=size[v]; 
 35       if (size[v]>size[son[x]]) son[x]=v;
 36     } 
 37 }
 38 void dfs2(int x,int pa,int tp)
 39 {int i;
 40   top[x]=tp;
 41   dfn[x]=++tot;
 42   if (son[x]) dfs2(son[x],x,tp);
 43   for (i=head[x];i;i=edge[i].next)
 44     {
 45       int v=edge[i].to;
 46       if (v==pa||son[x]==v) continue;
 47       dfs2(v,x,v);
 48     }
 49 }
 50 int query(int rt,int l,int r,int L,int R)
 51 {
 52   if (!rt) return 0;
 53   if (l>=L&&r<=R) return c[rt];
 54   int mid=(l+r)/2,as=0;
 55   if (L<=mid) as+=query(ch[rt][0],l,mid,L,R);
 56   if (R>mid) as+=query(ch[rt][1],mid+1,r,L,R);
 57   return as;
 58 }
 59 int ask(int x,int y,int c)
 60 {
 61   int as=0;
 62   while (top[x]!=top[y])
 63     {
 64       if (dep[top[x]]<dep[top[y]]) swap(x,y);
 65       as+=query(root[c],1,n,dfn[top[x]],dfn[x]);
 66       x=fa[top[x]];
 67     }
 68   if (dep[x]>dep[y]) swap(x,y);
 69   as+=query(root[c],1,n,dfn[x],dfn[y]);
 70   return as;
 71 }
 72 void update(int &rt,int l,int r,int x)
 73 {
 74   if (!rt)
 75     {
 76       if (Q.empty()==0) rt=Q.front(),Q.pop();
 77       else rt=++pos;
 78     }
 79   c[rt]++;
 80   if (l==r) return;
 81   int mid=(l+r)/2;
 82   if (x<=mid) update(ch[rt][0],l,mid,x);
 83   else update(ch[rt][1],mid+1,r,x);
 84 }
 85 void del(int &rt,int l,int r,int x)
 86 {
 87   c[rt]--;
 88   if (l==r&&c[rt]==0)
 89     {
 90       Q.push(rt);
 91       rt=0;
 92     }
 93   if (l==r) return;
 94   int mid=(l+r)/2;
 95   if (x<=mid) del(ch[rt][0],l,mid,x);
 96   else del(ch[rt][1],mid+1,r,x);
 97   if (c[rt]==0)
 98     {
 99       ch[rt][0]=ch[rt][1]=0;
100       Q.push(rt);
101       rt=0;
102     }
103 }
104 int main()
105 {int i,u,v,x,y,c;
106   char s[21];
107   cin>>n>>q;
108   for (i=1;i<=n;i++)
109     {
110       scanf("%d",&t[i]);
111       if (mp.count(t[i])==0) mp[t[i]]=++cnt;
112       t[i]=mp[t[i]];
113     }
114   for (i=1;i<=n-1;i++)
115     {
116       scanf("%d%d",&u,&v);
117       add(u,v);add(v,u);
118     }
119   dfs1(1,0);
120   dfs2(1,0,1);
121   for (i=1;i<=n;i++)
122     {
123       update(root[t[i]],1,n,dfn[i]);
124     }
125   ans=0;
126   while (q--)
127     {
128       scanf("%s",s);
129       if (s[0]==‘Q‘)
130     {
131       scanf("%d%d%d",&x,&y,&c);
132       x^=ans;y^=ans;c^=ans;
133       ans=0;
134       if (mp.count(c)==0)
135         {
136           printf("0\n");
137           continue;
138         }
139       c=mp[c];
140       ans=ask(x,y,c);
141       printf("%d\n",ans);
142     }
143       else
144     {
145       scanf("%d%d",&x,&c);
146       x^=ans;c^=ans;
147       del(root[t[x]],1,n,dfn[x]);
148       if (mp.count(c)==0) mp[c]=++cnt;
149       t[x]=mp[c];
150       update(root[t[x]],1,n,dfn[x]);
151     }
152     }
153 }