xmpp的Tsung.xml配置编译Tsung后/usr/share/doc/tsung下包含测试的配置实例xml和tsung的用户手册user_manual.html本次测试使用以下配置online-->connected-->(.*)"/>3.Tsung报表分析对报表参数不太了解可以试着参看服务...
分类：
其他好文 时间：
2014-08-06 18:40:03
阅读次数：
363
ROADSTime Limit:1000MSMemory Limit:65536KTotal Submissions:10777Accepted:3961DescriptionN cities named with numbers 1 ... N are connected with one-way...
分类：
其他好文 时间：
2014-08-05 10:55:59
阅读次数：
977
四种会发生Radio Link Failure的场景- DL Physical Layer Failure (PDCCH BLER > 10%)- Random Access Problems (in Connected State)- Failure after RLC retransmissio...
分类：
其他好文 时间：
2014-08-05 00:08:48
阅读次数：
363
Description
ACM has bought a new crane (crane -- je?áb) . The crane consists of n segments of various lengths, connected by flexible joints. The end of the i-th segment is joined to the beginning o...
分类：
其他好文 时间：
2014-08-04 17:55:37
阅读次数：
240
C - Network of Schools
Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d
& %I64u
Submit Status
Description
A number of schools are connected to a computer network....
分类：
其他好文 时间：
2014-08-04 11:02:27
阅读次数：
177
Problem Description
Continuous Same Game is a simple game played on a grid of colored blocks. Groups of two or more connected (orthogonally, not diagonally) blocks that are the same color may be r...
分类：
其他好文 时间：
2014-08-03 23:21:29
阅读次数：
336
Description
There is a number of disjoint vertical line segments in the plane. We say that two segments are horizontally visible if they can be connected by a horizontal line segment that does not ...
分类：
其他好文 时间：
2014-08-03 23:16:26
阅读次数：
412
Description
Each of the M lanes of the Park of Polytechnic University of Bucharest connects two of the N crossroads of the park (labeled from 1 to N). There is no pair of crossroads connected by mo...
分类：
其他好文 时间：
2014-08-02 23:27:14
阅读次数：
327
The Unique MST
Time Limit: 1000MS
Memory Limit: 10000K
Total Submissions: 20293
Accepted: 7124
Description
Given a connected undirected graph, tell if its minimum spa...
分类：
其他好文 时间：
2014-08-02 20:58:54
阅读次数：
362
from byvoid[有向图强连通分量]在有向图G中，如果两个顶点间至少存在一条路径，称两个顶点强连通(strongly connected)。如果有向图G的每两个顶点都强连通，称G是一个强连通图。非强连通图有向图的极大强连通子图，称为强连通分量(strongly connected compon...
分类：
其他好文 时间：
2014-08-02 20:47:14
阅读次数：
289
