25阅读
2评论
clude#include#include#

104阅读

26阅读
2评论
#include<iostream> //Dijkstra+优先队列 1735MS!#include<queue>#define maxn 1000002using namespace std;struct Edge { int v; int weight; int next;}Vertex[maxn];int head[maxn],curr; const __int64 inf=(__int64)1<<63-1; int cases,p,e,i,j,edge[maxn][3];void graph(int tag){ int u,v,w; curr=0;

50阅读
Invitation CardsTime Limit: 8000MSMemory Limit: 262144KTotal Submissions: 15101Accepted: 4897DescriptionIn the age of television, not many people attend theater performances. Antique Comedians of Malidinesia are aware of this fact. They want to propagate theater and, most of all, Antique Comedies. T

77阅读
Invitation Cards 翻译： 描述 在电视时代，没有多少人参加戏剧表演。 Malidinesia古董喜剧演员知道这个事实。他们想传播戏剧，最重要的是古董喜剧。他们已经印制了包含所有必要信息和程序的邀请卡。许多学生被聘请将这些邀请分发给人们。每个学生志愿者都分配了一个公交车站，并且他或她在

51阅读
2评论

28阅读

37阅读

25阅读
DescriptionIn the age of television, not many people attend theater performances. Antique Comedians of Malidinesia are aware of this fact. They want to propagate theater and, most of all, Antique Comedies. They have printed invitation cards with all the n

29阅读
DescriptionIn the age of television, not many people attend theater performances.

78阅读
【题目链接】:http://hihocoder.com/problemset/problem/1511【题意】 【题解】 有个方差的公式 V(X)=E(X2)−E(X)2 这里E(X)指的是X的期望; 显然所有树的度数的期望都是2*(n-1)/n 则问题转换成求E(X^2)了; 这...

72阅读
2评论
DescriptionIn the age of television, not many people attend theater performances. Antique Comedians of Malidinesia are aware of this fact. They want to propagate theater and, most of all, Antique Comedies. They have printed invitation cards with all the n

48阅读

33阅读
2评论

15阅读
2评论
https://vjudge.net/problem/UVA-1151 题意，给出N个点以及二维坐标，可以在任意两点间建立通路，代价是两点欧几里得距离的平方，同时有q个套餐，套餐x有qx个点，代价是qw， 花费qw就能将这qx个点全部相联通，套餐可以任意选择几种或不选，求将所有的点联通所要的最小代价

46阅读
2评论

25阅读
2评论

126阅读
2评论

53阅读
2评论
• 1
• 2
• 3
• 4
• 5