Network
Time Limit: 1000MS
Memory Limit: 30000K
Total Submissions: 14976
Accepted: 5875
Special Judge
Description
Andrew is working as system administrator and is p
原创
2023-04-20 15:26:23
47阅读
NetworkTime Limit:1000MSMemory Limit:30000KTotal Submissions:11041Accepted:4200Special JudgeDescriptionAndrew is working as system administrator and is planning to establish a new network in his company. There will be N hubs in the company, they can be connected to each other using cables. Since eac
转载
2013-02-14 16:33:00
52阅读
ecial JudgeDescriptionAndrew is working as system administrator and is
原创
2023-02-24 10:34:47
45阅读
最小生成树
原创
2023-02-17 08:46:54
63阅读
（╯－＿－）╯╧╧ 此处为错误代码。
转载
2016-08-04 17:05:00
90阅读
2评论
#include <iostream> //kruskalusing namespace std;const int max_ve=1005,max_ed=15005;int n,m,i,flag[max_ed]; //n,m分别记录顶点数和边数struct node{ int par;}vertex[max_ve];struct Edge { int u,v,weigh;}edge[max_ed];int cmp(const void* a,const void* b){ return (*(Edge*)a).weigh-(*(Edge*)b).weigh;}int find_p
转载
2011-07-22 16:30:00
24阅读
2评论
NetworkTime Limit: 1000msMemory Limit: 30000KBThis problem will be judged onPKU. Original ID:186164-bit integer IO format:%lld Java class name:MainAnd...
转载
2014-11-20 19:38:00
47阅读
1、 TNS:listener does not currently know of service requested in connect descriptor 数据库连接出错
转载
2018-07-11 16:13:00
82阅读
NetworkTime Limit: 1000MSMemory Limit: 30000KTotal Submissions: 10104Accepted: 3796Special JudgeDescriptionAndrew is working as system administrator and is planning to establish a new network in his company. There will be N hubs in the company, they can be connected to each other using cables. Since
原创
2021-07-29 16:19:22
88阅读
最小生成树，由于是special judge 所以不用非得结果和样例一样View Code #include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>#include <algorithm>using namespace std;#define maxm 15005#define maxn 1005struct Edge{ int u, v, w;}edge[maxm], mst[maxm];int n, m, ecount, father[maxn
转载
2011-06-11 13:10:00
35阅读
2评论
思路：搞搞平衡树。
转载
2018-09-06 18:13:00
43阅读
2评论
// 596K 141MS G++#include #include #include using namespace std;struct Connetcions { int begin; int end; in b)
原创
2023-05-23 15:56:14
35阅读
最小生成树 kruskal
转载
2016-09-21 15:02:00
59阅读
2评论
DescriptionAndrew is working as system administrator and is planning to establish a new
原创
2023-04-24 07:34:30
44阅读
NetworkTime Limit:1000MSMemory Limit:30000KTotal Submissions:11372Accepted:4337Special JudgeDescriptionAndrew is working as system administrator and is planning to establish a new network in his company. There will be N hubs in the company, they can be connected to each other using cables. Since eac
转载
2013-04-17 21:52:00
133阅读
2评论
[oracle@c2 ~]$ sqlplus / as sysdba
SQL*Plus: Release 10.2.0.1.0 - Production on Sat Oct 22 15:57:41 2011
Copyright (c) 1982, 2005, Oracle. All rights reserved.
Connected to an idle instance.
原创
2011-10-22 16:16:56
648阅读
转载：Oracle Linux: Error "Missing Or Invalid IPv4 Prefix '0' On Linux Server" (文档 ID 1522095.1)Applies to: Linux OS - Version Oracle Linux 5.5 and laterLinux x86-64SymptomsNetwork manager thr
转载
2021-10-29 11:20:07
164阅读
刚开始用prim,,加pre[ ]的方法一直WA，后来改用这个方法，#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define N 150001struct
原创
2023-07-27 18:40:57
70阅读
1,oracle jdbcHTTP Status 500 - Incorrect result size: expected 1, actual 02015-03-31 00:03:58,250 SQL Error: 129, SQLState: 720002015-03-31 00:03:58...
原创
2021-12-27 10:40:03
364阅读
忽略奇数偶数步，忽略胶水，就是一个一维dp，例如只能走1 2 4步，dp[n] = dp[n - 1] + dp[n - 2] + dp[n - 4] （当然要注意最后的台阶要单独处理 因为可以到负的层次） 加上奇数偶数步，那就是一个二维dp, dp[0][j]表示偶数步到i层，dp[1][i]表示 ...
转载
2021-04-23 15:17:00
56阅读
2评论
