2017年05月_eeetttzhangji

原创树状数组维护区间最大值

C. Fountainstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputArkady plays Gardenscapes a lot. Arkady wants

2017-05-31 23:36:58 1380

原创优先队列实现成员的增减

B. T-shirt buyingtime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputA new pack of n t-shirts came to a shop.

2017-05-31 21:46:09 389

原创树形DP入门

Anniversary partyTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11046 Accepted Submission(s): 4575Problem DescriptionThere is go

2017-05-25 21:21:54 237

原创 Focus on Small Steps First, Then Shift to the Larger Goal

Research shows that incremental achievements are good early motivators, but their effect wanes as the finish line nears.May 17, 2017|by Louise Lee2 17

2017-05-25 20:44:41 367

原创区间DP，子问题的深刻理解

算法提高矩阵乘法时间限制：3.0s 内存限制：256.0MB 问题描述　　有n个矩阵，大小分别为a0*a1, a1*a2, a2*a3, ..., a[n-1]*a[n]，现要将它们依次相乘，只能使用结合率，求最少需要多少次运算。　　两个大小分别为p*q和q*r的矩阵相乘时的运算次数计为p*q*r。输入格式　　输入的第一行

2017-05-25 19:22:21 535

原创最大生成树 Keroskal

ConscriptionTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 13352 Accepted: 4674DescriptionWindy has a country, and he wants to build an army to protect

2017-05-25 10:06:26 347

原创 C - 看病要排队

看病要排队这个是地球人都知道的常识。不过经过细心的0068的观察，他发现了医院里排队还是有讲究的。0068所去的医院有三个医生（汗，这么少）同时看病。而看病的人病情有轻重，所以不能根据简单的先来先服务的原则。所以医院对每种病情规定了10种不同的优先级。级别为10的优先权最高，级别为1的优先权最低。医生在看病时，则会在他的队伍里面选择一个优先权最高的人进行诊治。如果遇到两个优先权一样的病人的话

2017-05-24 00:11:07 1283

原创 B - 胜利大逃亡(续) (bfs,状态压缩）

Ignatius再次被魔王抓走了(搞不懂他咋这么讨魔王喜欢)…… 这次魔王汲取了上次的教训，把Ignatius关在一个n*m的地牢里，并在地牢的某些地方安装了带锁的门，钥匙藏在地牢另外的某些地方。刚开始Ignatius被关在(sx,sy)的位置，离开地牢的门在(ex,ey)的位置。Ignatius每分钟只能从一个坐标走到相邻四个坐标中的其中一个。魔王每t分钟回地牢视察一次，若发现Ignat

2017-05-23 22:34:50 390

You are an experienced Codeforces user. Today you found out that during your activity on Codeforces you have made y submissions, out of which x have been successful. Thus, your current success rate on

2017-05-23 15:25:45 382

原创最近公共祖先（map的用法，string类型empty函数）

#1062 : 最近公共祖先·一时间限制:10000ms单点时限:1000ms内存限制:256MB描述小Ho最近发现了一个神奇的网站！虽然还不够像58同城那样神奇，但这个网站仍然让小Ho乐在其中，但这是为什么呢？“为什么呢？”小Hi如是问道，在他的观察中小Ho已经沉迷这个网站一周之久了，甚至连他心爱的树玩具都弃置一边。“嘿嘿，小H

2017-05-23 12:19:30 678 1

原创 Stanford scholars, researchers discuss key ethical questions self-driving cars present

Self-driving technology presents vast ethical challenges and questions. Several professors and interdisciplinary groups at Stanford who are tackling this issue offer their perspectives on the topic.

2017-05-23 11:19:11 647

原创 Assuming easy carbon removal from the atmosphere is a high-stakes gamble, Stanford scientists say

With the current pace of renewable energy deployment and emissions reductions efforts, the world is unlikely to achieve the Paris Climate Agreement’s goal of limiting global warming to 2 degrees C abo

2017-05-22 12:17:15 374

原创 E. Ice cream coloring （图论染色 DFS）

E. Ice cream coloringtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputIsart and Modsart were trying to solv

2017-05-22 00:10:23 595

原创分析推断题

#include #include #include #include #include #include #include #include using namespace std; #define inf 0x3f3f3f3f #define LL long long const LL mod=1e9+7; char s[1

2017-05-19 21:43:56 234

原创卡特兰数

先给出计算组合数的公式：#includeusing namespace std;int count_=0;//求组合数C(m,k)个数,k>=1int comb1(int m,int k)//(C(m,k)){ int i; for (i=m;i>=k;i--) { if (k>1) {

2017-05-19 21:13:09 269

原创 World’s largest health big data institute opens in Oxford

A new £115 million biomedical research centre will pave the way for treatments for some of the biggest population health issues around the globe, potentially improving the everyday lives of millions.

2017-05-19 13:56:15 372

原创树形DP

#1055 : 刷油漆时间限制:10000ms单点时限:1000ms内存限制:256MB描述上回说到，小Ho有着一棵灰常好玩的树玩具！这棵树玩具是由N个小球和N-1根木棍拼凑而成，这N个小球都被小Ho标上了不同的数字，并且这些数字都是处于1..N的范围之内，每根木棍都连接着两个不同的小球，并且保证任意两个小球间都不存在两条不同的路径可以互

2017-05-18 18:44:33 259

原创 African lions face same threats as extinct Ice Age ancestors

The extinction trends that caused the demise of several Ice Age species, including many of the sabre-toothed family, may be a threat to wildlife today and particularly to the African lion, a new Oxfor

2017-05-16 17:06:29 294

原创 Three Oxford scientists elected to Academy of Medical Sciences

Three of the University's scientists have been elected to the prestigious Fellowship of the Academy of Medical Sciences for their contribution to biomedical and health research, the generation of new

2017-05-16 15:55:59 306

转载贪心最重要的是找出贪心的策略

请在整数 n 中删除m个数字, 使得余下的数字按原次序组成的新数最大，比如当n=92081346718538，m=10时，则新的最大数是9888 输入第一行输入一个正整数T，表示有T组测试数据每组测试数据占一行，每行有两个数n,m（n可能是一个很大的整数，但其位数不超过100位，并且保证数据首位非0，m小于整数n的位数）输出每组测试数据的输出占一行，输出剩余的数字按原次序组

2017-05-16 15:37:21 331

原创卡时间复杂很严格的题

素数环时间限制：1000 ms | 内存限制：65535 KB难度：2描述有一个整数n，把从1到n的数字无重复的排列成环，且使每相邻两个数（包括首尾）的和都为素数，称为素数环。为了简便起见，我们规定每个素数环都从1开始。例如，下图就是6的一个素数环。输入有多组测试数据，每组输入一个n(0输出每组第一行输出对应的Case序号

2017-05-16 14:19:50 440

原创 Is it easier to forge a £1 coin or a Leonardo?

It has been claimed that the new £1 coin is 'forgery proof'. But Martin Kemp, professor of the history of art at Oxford University and an expert in art forgeries, is sceptical.'In theory, any tech

2017-05-16 13:45:36 257

原创考察思维的灵活性，僵化

描述有一楼梯共m级，刚开始时你在第一级，若每次只能跨上一级或二级，要走上第m级，共有多少走法？注：规定从一级到一级有0种走法。输入输入数据首先包含一个整数n(1输出对于每个测试实例，请输出不同走法的数量。样例输入223样例输出12 我就是DFS，然后稳稳的收获了TLE，我能怎么办，我自己也是找不到更好的办法，因为之前做过很多这样的题，都是

2017-05-15 22:00:13 373

原创贪心问题理解

描述C小加有一些木棒，它们的长度和质量都已经知道，需要一个机器处理这些木棒，机器开启的时候需要耗费一个单位的时间，如果第i+1个木棒的重量和长度都大于等于第i个处理的木棒，那么将不会耗费时间，否则需要消耗一个单位的时间。因为急着去约会，C小加想在最短的时间内把木棒处理完，你能告诉他应该怎样做吗？输入第一行是一个整数T(1每组测试数据的第一行是一个整数N（1输出处理这些木棒的

2017-05-15 21:55:57 308

原创 'Humbling' hospital simulations inspire Stanford graduate students to solve problems in health care

Students in a Biodesign Innovation class got a first-hand look at challenges in health care with intense – and inspiring – hospital simulations. These students took what they learned in the simulation

2017-05-14 21:31:31 381

原创 bitset优化

#1513 : 小Hi的烦恼时间限制:5000ms单点时限:1000ms内存限制:1024MB描述小Hi从小的一大兴趣爱好就是学习，但是他发现尽管他认真学习，依旧有学神考的比他好。小Hi在高中期间参加了市里的期末考试，一共五门：语文、数学、英语、物理、化学。成绩出来之后，小Hi发现有些同学，所有科目都考的比他好，他很烦恼。所以

2017-05-14 20:31:09 599

原创 Commitment, generosity guide Iranian Studies program to great heights

TwitterEmailBY ALEX SHASHKEVICHWhen the Iranian Studies program began in the 2005-06 academic year, only two classes were offered. Since then, under the direction of Abbas Milani, the

2017-05-14 18:34:43 285

原创 Flexible, organic and biodegradable: Stanford researchers develop new wave of electronics

A new semiconductor developed by Stanford researchers is as flexible as skin and easily degradable. It could have diverse medical and environmental applications, without adding to the mounting pile of

2017-05-04 00:00:28 938

Accepted ALL lve