algzjh的博客

N皇后问题Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 18689    Accepted Submission(s): 8452Problem Description在N*N的方格棋盘放置了N个皇后，使得它们

单源最大权路径Description 有一棵由N个结点构成的树，每一条边上都有其对应的权值。现在给定起点，求从该点出发的一条路径（至少有一条边）使得这条路径上的权值之和最大，并输出这个最大值。Input 第一行一个正整数T，代表数据组数。每组数据第一行两个正整数n(2<=n<=10^5),s(1<=s<=n)，分别表示树结点数目以及给定的起点，点的编号从1至N。接下来M行，每行三个整数x,y,z

D - Transit Tree PathTime limit : 2sec / Memory limit : 256MBScore : 400 points Problem StatementYou are given a tree with N vertices. Here, a tree is a kind of graph, and more specifically, a connec

Tic-Tac-ToeKim likes to play Tic-Tac-Toe.Given a current state, and now Kim is going to take his next move. Please tell Kim if he can win the game in next 2 moves if both player are clever enough.Here

中国麻将（Chinese Mahjong,UVa 11210）刘汝佳白书P21上的题目传送门：点击打开链接用暴力枚举所有可能的组合方式首先选两张牌作为“将”，然后每次选3张牌作为刻子或顺子，递归求解陷阱：每一种牌都只有4张，所以1S1S1S1S是不“听”任何牌的。#include#include//#includeint c[34];const

A. NP-Hard Problemtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputRecently, Pari and Arya did some research about NP

BeatTime Limit: 6000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1477    Accepted Submission(s): 870Problem DescriptionZty is a man that always

f(x)=g(x)+h(x)f(x)=g(x)+h(x) f(x)f(x)为估价函数 g(x)g(x)表示从初始状态到结点xx的实际代价 h(x)h(x)是启发性函数，表示xx到目标状态结点的最优搜索路径的评估代价。

MonkeysTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 153428/153428 K (Java/Others) Total Submission(s): 729 Accepted Submission(s): 234Problem Description There is a tree having N vertic

#include<iostream>#include<cstdio>#include<algorithm>#include<queue>#include<cstring>using namespace std;typedef long long LL;const LL INF=1e18;const int MAXN=1e5+5;int perm[MAXN];bool used[M

vector<int> G[MAXN];int V;int color[MAXN];bool dfs(int v,int c){ color[v]=c; for(int i=0;i<G[v].size();i++) { if(color[G[v][i]]==c) return false; if(color[G[v][i]]==0&&!d

先dfs一次求出每个结点的子树大小，再dfs一遍维护答案，以i为根的子树的最多结点个数为max{max(dp[j]),n−dp[i]}max{max(dp[j]),n−dp[i]}max\{max(dp[j]),n-dp[i]\}

Colorful TreeTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 1575 Accepted Submission(s): 636Problem Description There is a tree with n n

RXD and dividingTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others) Total Submission(s): 65 Accepted Submission(s): 15Problem Description RXD has a tree T, with t

C - Cat Snuke and a VoyageTime limit : 2sec / Memory limit : 256MBScore : 300 pointsProblem Statement In Takahashi Kingdom, there is an archipelago of N islands, called Takahashi Islands. For convenie

Prime Ring ProblemTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 43299    Accepted Submission(s): 19214Problem DescriptionA ring

Network SaboteurTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 11535Accepted: 5584DescriptionA university network is composed of N computers. System a

D -速算24点Crawling in process...Crawling failedTime Limit:1000MS    Memory Limit:32768KB     64bit IO Format:%I64d & %I64uSubmitStatus Practice HDU 1427 uDebugDescri

E - SticksCrawling in process...Crawling failedTime Limit:1000MS    Memory Limit:32768KB     64bit IO Format:%I64d & %I64uSubmitStatus Practice HDU 1455 uDebugDescrip

M. Subimage RecognitionTime Limit: 1000msCase Time Limit: 1000msMemory Limit: 131072KB64-bit integer IO format: %lld      Java class name: MainSubmit StatusFont Size: + 

1930: roadsSubmit Page Summary Time Limit: 1 Sec Memory Limit: 128 Mb Submitted: 35 Solved: 12 Description Once upon a time there was a strange kingdom, the kingdom had n cities wh

How Many TablesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 30283 Accepted Submission(s): 14985Problem Description Today is Ignatius’ bi

商汤科技的安全令牌商汤科技致力于引领人工智能核心“深度学习”技术突破，构建人工智能、大数据分析行业解决方案。作为一家人工智能公司，用机器自动地解决各类实际问题自然不在话下。近日，商汤科技推出了一套安全令牌，令牌如下图所示：安全令牌上的小孔有 nn 行 mm 列，不过有些行和有些列已经用导线整体焊接了，共有 kk 根导线。我们可以在安全令牌上 不重叠 地焊接若干个小芯片，每个芯片需要在相邻（不能斜着相

#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<vector>#include<map>#include<string>#include<cmath>using namespace std;const int MAXN=1000;const int INF=0x3f3f3

Fire NetTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 11938 Accepted Submission(s): 7175Problem Description Suppose that we have a square

给自己出题的小XSubmit Page Summary Time Limit: 1 Sec Memory Limit: 128 Mb Submitted: 126 Solved: 43 Description 小X学习了dfs，为了练习搜索，开始给自己出题玩。 玩着玩着，一会把自己难住了，一会又被自己难倒了，真是有趣诶！ 小X出的题： 现在有N个不同的

DFS#include&lt;bits/stdc++.h&gt;using namespace std;string n,minans,maxans;int k,len;void dfs1(string s,int pos,int step){ if(pos&gt;=len||step&gt;=k) {minans=min(minans,s);return;} boo...