暑假训练DAY13测验（简单DP区间DP树型DP）

最新推荐文章于 2022-03-15 20:31:11 发布

Flyppy_White

最新推荐文章于 2022-03-15 20:31:11 发布

阅读量481

点赞数

分类专栏：暑假集训

本文链接：https://blog.csdn.net/baiyifeifei/article/details/81459405

版权

暑假集训专栏收录该内容

40 篇文章 1 订阅

订阅专栏

A - Tri Tiling

POJ - 2663

In how many ways can you tile a 3xn rectangle with 2x1 dominoes?
Here is a sample tiling of a 3x12 rectangle.

Input

Input consists of several test cases followed by a line containing -1. Each test case is a line containing an integer 0 <= n <= 30.

Output

For each test case, output one integer number giving the number of possible tilings.

Sample Input

Sample Output

3
153
2131

我们可以发现每一个状态的数量都等于他的少2的情况×3加上少2的倍数的情况×2的和，也就是

p[2n]=3*p[2n-2]+2*(p[2n-4]+p[2n-6]+.........p[2]+p[0]);

需要注意的是0的时候状态数是1

#include<algorithm>
#include<iostream>
#include<cstring>
#include<string>
#include<cstdio>
#include<vector>
#include<stack>
#include<cmath>
#include<queue>
#include<set>
#include<map>
//#define int long long
#define endl '\n'

using namespace std;

int main()
{
	int ans[31];
	memset(ans,0,sizeof(ans));
	ans[0]=1;
	ans[2]=3;
	for(int i=4;i<=30;i+=2)
	{
		ans[i]=4*ans[i-2]-ans[i-4];
	}
	int n;
	while(~scanf("%d",&n)&&n!=-1)
	{
		cout<<ans[n]<<endl;
	}
	return 0;
}

最大金额

时间限制： 1000MS		内存限制： 65536K
提交总数： 43758		接受： 13603

描述

给定一组n个整数：A = {a1，a2，...，an}，我们定义函数d（A）如下：

你的任务是计算d（A）。

输入

输入由T（<= 30）个测试用例组成。测试用例（T）的数量在输入的第一行给出。
每个测试用例包含两行。第一行是整数n（2 <= n <= 50000）。第二行包含n个整数：a1，a2，...，an。（| ai | <= 10000）。每个案例后都有一个空行。

产量

每个测试用例只打印一行。该行应包含整数d（A）。

Sample Input

1

10
1 -1 2 2 3 -3 4 -4 5 -5

Sample Output

暗示

在样本中，我们选择{2,2,3，-3,4}和{5}，然后我们就可以得到答案。

建议使用大量输入scanf。

正向和反向分别找出最大连续序列，枚举点找出正向和反向之和最大的点

#include<iostream>
#include<cstdio>
#include<cstring>
#include<climits>
using namespace std;
const int size=5e5+5;
const long long inf=0x3f3f3f3f;
long long maxnl[size],maxnr[size];
long long arr[size];
int main()
{
	int i;
	int t,n;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d",&n);
		fill(maxnl,maxnl+n,0);
		fill(maxnr,maxnr+n,0);
		for(i=0;i<n;i++)
		{
			scanf("%lld",&arr[i]);
		}
		int ans=-inf,dp=0;
		for(i=0;i<n;i++)
		{
			if(dp>0)
			dp+=arr[i];
			else dp=arr[i];
			if(dp>ans) ans=dp;
			maxnl[i]=ans;
		}
		ans=-inf,dp=0;
		for(i=n-1;i>=0;i--)
		{
			if(dp>0)
			dp+=arr[i];
			else dp=arr[i];
			if(dp>ans) ans=dp;
			maxnr[i]=ans;
		}
		long long maxn=-inf;
		for(int k=0;k<n-1;k++)
		{
			//cout<<k<<' '<<maxnl[k]+maxnr[k]<<' '<<maxnl[k]<<endl;
			maxn=max(maxnl[k]+maxnr[k+1],maxn);
		}
		cout<<maxn<<endl;
	}
}

Consider a tree T with N (1 <= N <= 20,000) nodes numbered 1...N. Deleting any node from the tree yields a forest: a collection of one or more trees. Define the balance of a node to be the size of the largest tree in the forest T created by deleting that node from T.
For example, consider the tree:

Deleting node 4 yields two trees whose member nodes are {5} and {1,2,3,6,7}. The larger of these two trees has five nodes, thus the balance of node 4 is five. Deleting node 1 yields a forest of three trees of equal size: {2,6}, {3,7}, and {4,5}. Each of these trees has two nodes, so the balance of node 1 is two.

For each input tree, calculate the node that has the minimum balance. If multiple nodes have equal balance, output the one with the lowest number.

Input

The first line of input contains a single integer t (1 <= t <= 20), the number of test cases. The first line of each test case contains an integer N (1 <= N <= 20,000), the number of congruence. The next N-1 lines each contains two space-separated node numbers that are the endpoints of an edge in the tree. No edge will be listed twice, and all edges will be listed.

Output

For each test case, print a line containing two integers, the number of the node with minimum balance and the balance of that node.

Sample Input

Sample Output

1 2

求树的权重。先转化成有根树，然后从根节点进行遍历（找过的点打上标记不再搜索），找出每个点的子树的节点，取其中的最大值，而去完所有的子树之后剩余的剩余的点就是父节点方向的（可以想想，因为是从父节点来的，所以搜索时就不会搜索上那条边，同时父节点总是只有一个的，所以即使剩下的子树的根数）再取出其中的最小值即可

#include<algorithm>
#include<iostream>
#include<cstring>
#include<string>
#include<cstdio>
#include<vector>
#include<stack>
#include<cmath>
#include<queue>
#include<set>
#include<map>
#define sc(x) scanf("%d",&x)
#define ii(x) int i=x
#define ms(name) memset(name,0,sizeof(name))
#define endl '\n'
const int inf=0x3f3f3f3f;
using namespace std;
vector<int> edge[20005];
#define vc(n) for(ii(1);i<=n;i++) edge[i].clear();
int dp[20005];
int flag[20005];
int nowmaxn,maxnpoint;
int n;
int dfs(int point)
{
	flag[point]=1;
	int maxn=0;
	for(ii(0);i<edge[point].size();i++)
	{
		if(!flag[edge[point][i]])
		{
			int tt=dfs(edge[point][i])+1;
			maxn=max(maxn,tt);
			dp[point]+=tt;
		}
	}
	int lost=n-1-dp[point];
	maxn=max(maxn,lost);
	if(maxn<nowmaxn)
	{
		maxnpoint=point;
		nowmaxn=maxn;
	} 
	
	return dp[point];
}
int main()
{
	int t;
	scanf("%d",&t);
	while(t--)
	{
		ms(dp);
		ms(flag);
		
		sc(n);
		vc(n);
		for(ii(1);i<=n-1;i++)
		{
			int a,b;
			sc(a),sc(b);
			edge[a].push_back(b);
			edge[b].push_back(a);
		}
		nowmaxn=inf;
		
		dfs(1);
		cout<<maxnpoint<<' '<<nowmaxn<<endl;
	}
	return 0;
}

Flyppy_White

关注

0
点赞
踩
1

收藏

觉得还不错? 一键收藏
0
评论
暑假训练DAY13测验（简单DP区间DP树型DP）

A - Tri Tiling POJ - 2663 In how many ways can you tile a 3xn rectangle with 2x1 dominoes? Here is a sample tiling of a 3x12 rectangle. InputInput consists of several test cases followed by...
复制链接

扫一扫