Codeforces 545 C Woodcutters(贪心/DP)
来源:互联网 发布:win7电脑连接网络 编辑:程序博客网 时间:2024/05/01 22:35
题目链接:
Codeforces 545 C Woodcutters
题意:
有n棵树,每棵树都有位置坐标
/**************DP Solution**************/#include <cstdio>#include <cstring>#include <cmath>#include <algorithm>#include <climits>using namespace std;const int maxn=100010;int n,x[maxn],h[maxn],dp[maxn][3];int main(){ //freopen("in.txt","r",stdin); while(~scanf("%d",&n)){ for(int i=1;i<=n;i++){ scanf("%d%d",&x[i],&h[i]); } if(n<=2){ printf("%d\n",n); continue; } x[n+1]=INT_MAX; memset(dp,0,sizeof(dp)); dp[1][0]=0; dp[1][1]=1; if(x[1]+h[1]<x[2]) dp[1][2]=1; for(int i=2;i<=n;i++){ //ith tree stay at position dp[i][0]=max(dp[i-1][0],max(dp[i-1][1],dp[i-1][2])); //cut ith to left, must if(x[i]-h[i]>x[i-1]) dp[i][1]=max(dp[i][1],max(dp[i-1][0],dp[i-1][1])+1); if(x[i]-h[i]>x[i-1]+h[i-1]) dp[i][1]=max(dp[i][1],dp[i-1][2]+1); //cut ith tree to right, must if(x[i]+h[i]<x[i+1]){ dp[i][2]=max(dp[i-1][0],max(dp[i-1][1],dp[i-1][2]))+1; } } int ans=max(dp[n][0],max(dp[n][1],dp[n][2])); printf("%d\n",ans); } return 0;}
/*********Greedy Solution**********///46MS 2800K#include <cstdio>#include <cstring>#include <cmath>#include <algorithm>#include <climits>using namespace std;const int maxn=100010;int n,x[maxn],h[maxn];int main(){ while(~scanf("%d",&n)){ for(int i=1;i<=n;i++){ scanf("%d%d",&x[i],&h[i]); } if(n<=2){ printf("%d\n",n); continue; } int ans=2; for(int i=2;i<n;i++){ if(x[i]-h[i]>x[i-1]){ ans++; }else if(x[i]+h[i]<x[i+1]){ ans++; x[i]+=h[i]; } } printf("%d\n",ans); } return 0;}
0 0
- Codeforces 545 C Woodcutters(贪心/DP)
- CodeForces 545C Woodcutters (贪心)
- Codeforces 545C Woodcutters【dp】
- CodeForces-545C Woodcutters 【贪心+机智】
- codeforces 545C C. Woodcutters(dp+二分)
- codeforces#303-C. Woodcutters-贪心
- CodeForces-545C Woodcutters
- Codeforces Round #303 (Div. 2) C. Woodcutters 贪心
- CF 545C Woodcutters
- Codeforces Round #303 (Div. 2)-C. Woodcutters(模拟)
- C. Woodcutters
- CodeForces 337C Captains Mode(dp+位运算+贪心)
- codeforces #422 C. Hacker, pack your bags!(贪心dp)
- Codeforces 77C 树形dp + 贪心
- CodeForces 508C (贪心)
- Codeforces 805C (贪心)
- CodeForces 478C (贪心)
- codeforces 571B--Minimization(贪心+dp)
- Spring框架的两个简化XML配置文件的p-namespace和c-namespace
- jQuery 事件注册与实时事件
- javascript 闭包
- 02-线性结构2 Reversing Linked List
- C#求三角形的周长和面积
- Codeforces 545 C Woodcutters(贪心/DP)
- 网上出名IT技术网站整理
- 程序人生-001-写程序我骄傲
- Linux常用基础指令记录
- #1034 : 毁灭者问题
- 如何学习C语言
- 进阶配置你的vim为c++IDE
- 堆和栈的区别(转过无数次的文章)
- Python机器学习实战(二)--决策树