Code Forces 448C Painting Fence 贪心递归

来源：互联网发布：中国农业银行软件编辑：程序博客网时间：2024/06/06 11:04

补题咯，最近好多题要补啊，各种比赛被虐，来不及补题了都，这题是长记性的题目，不算难吧，比较灵活考基本功的，看题目每次大家都具有的可以先去掉，然后分段一层一层的处理，这个贪心思想画一画就能够发现了，接下来就是怎么应用了，直接用深搜递归就可以了，当时写错了，还是漏了一些，现在补题才发现，长记性咯

http://codeforces.com/contest/448/problem/C

#include<iostream>#include<cstdio>#include<list>#include<algorithm>#include<cstring>#include<string>#include<queue>#include<stack>#include<map>#include<vector>#include<cmath>#include<memory.h>#include<set>#define ll long long#define eps 1e-8const int inf = 0xfffffff;const ll INF = 1ll<<61;using namespace std;//vector<pair<int,int> > G;//typedef pair<int,int > P;//vector<pair<int,int> > ::iterator iter;////map<ll,int >mp;//map<ll,int >::iterator p;int dfs(vector<int > G) {int minn = inf;int len = G.size();for(int i=0;i<G.size();i++)minn = min(G[i],minn);if(minn > len)return len;//这样横着来不如竖着来for(int i=0;i<G.size();i++)G[i] -= minn;int ans = minn;vector<int > now;for(int i=0;i<G.size();i++) {if(G[i])now.push_back(G[i]);else {ans += dfs(now);now.clear();}}if(now.size())ans += dfs(now);ans = min(len,ans);return ans;}int main() {int n;while(scanf("%d",&n) == 1) {vector<int > G;for(int i=0;i<n;i++) {int x;scanf("%d",&x);G.push_back(x);}int ans = dfs(G);printf("%d\n",ans);}return 0;}

0 0