不会吃鱼的喵

DescriptionWhen we are focusing on solving problems, we usually prefer to stay in front of computers rather than go out for lunch. At this time, we may call for food delivery.Suppose there are

GCD ExpectationTime Limit: 4 Seconds      Memory Limit: 262144 KB Edward has a set of n integers {a1, a2,...,an}. He randomly picks a nonempty subset {x1,x2,…,xm} (each nonempty subset h

Highway ProjectTime Limit: 2 Seconds      Memory Limit: 65536 KB Edward, the emperor of the Marjar Empire, wants to build some bidirectional highways so that he can reach other cities from

The Lucky WeekTime Limit: 2 Seconds      Memory Limit: 65536 KB Edward, the headmaster of the Marjar University, is very busy every day and always forgets the date.There was one day Ed

链接：http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=1676while(  ( t=DFS(S,T,INF) ) >=eps)没加括弧wa到哭//#pragma comment(linker, "/STACK:1024000000,1024000000")#include #includ

链接：http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=5595大致题意：用给出的数列a1,a2,a3....an构造二叉树，满足对于下标i和j，有i正序建树模拟一下，找到小于等于当前权值的一个可插入最大值，成为其子节点，找不到则新建树。#include using namespace std;