记一次惊险的物理作业提交

哈哈。DDL是5:00,而我4:59分交。正可谓:

《中庸》
中庸者,不偏不倚,无过不及,而平常之理,乃天命所当然。

不管怎样记录一下这个分形有多美

𝑥𝑛+1 = 𝜆𝑥𝑛(1 − 𝑥𝑛)

matlab代码实现如下:

x0=abs(sin(randn));
r=0:0.001:4;
xn=x0;
for i=1:150
xn=r.xn.(1-xn);
end
for i=1:200
xn=r.xn.(1-xn);
plot(r,xn,'k');
hold on
end

大概之后会补个mathematica的。反正学校有免费资源,为何不好好利用呢?

分析一下这次的物理作业。主要由玻尔兹曼分布和简单的概率运算组成。大概是知道了费曼随机行走在<mv2>中的应用。爱因斯坦用这鬼东西测出了玻尔兹曼常数,约莫着也是看到这个经典的东西。统计是个神奇的东西,现在还未能窥完全豹,CS仍会碰到吧。

What will this blog do?

Actually,  first of all, I should make use of my Tencent Server. Besides, I will make use of other functions like OSS.

Then I would push some life with my girl friend— My lover Bazinga.

Mutual symbol of her and me, by a Chinese drawer at twitter. I would purchase the property once I earn the money.

Since I’ve seen the film social network, I would make full use of the blog to witness every drop of my life, like f*ck people with decent words to let them angry.

I’m a MtF, English Exam Taker, Expired Photographer and a To-Be Tech Nerd at ShanghaiTech.

CF1189B Number Circle

水题

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<deque>

using namespace std;
const int inf = 1e5 + 5;
int n, s[inf],cnt;
deque<int> q;
int main()
{
	scanf("%d", &n);
	for (int i = 1; i <= n; i++)scanf("%d", &s[i]);
	sort(s, s + n + 1);
    for(int i=n;i>=1;i--)
    {
        if(cnt)q.push_front(s[i]),cnt^=1;
        else q.push_back(s[i]),cnt^=1;
    }
    cnt=0;
    deque<int>::iterator it;
    for(it=q.begin();it!=q.end();it++)
    s[++cnt]= *it ;
    for(int i=2;i<=n-1;i++)
    if(s[i-1]+s[i+1]<=s[i]){cout<<"NO";return 0;}
    if(s[n-1]+s[1]<=s[n]){cout<<"NO";return 0;}
    cout<<"YES"<<endl;
	for (int i = 1; i <= n; i++)cout << s[i] << " ";
	return 0;
}