TCO09 ROUND 3 SaveTheTrees (枚举的优化+函数优化)

题目链接：http://www.topcoder.com/stat?c=problem_statement&pm=10361

解题思路：

    最开始我想通过对砍掉的树数从小到大进行枚举，最大可以达到2^40，枚举量太大了。

    改变思路，通过枚举fence的大小，对fence外的和内的分别做处理，岂不是一个很好的思路。为了减少时间，可以在枚举前对tree按照height从大到小进行排序。同时枚举的时候可以保证后面的边比前面的大，也可以减少不少的枚举量。最后本题开始我用了两个函数outer()和inner()导致超时，直接把判断放到if里面就可以了，my god！

优化后的：

优化后的： #include<vector> #include <cmath> using namespace std; struct SaveTheTrees { inline void swap(int &x,int &y) { int temp; temp=x;x=y;y=temp; } inline bool outer(vector<int> x, vector<int> y,int num,int x1,int x2,int y1,int y2) { //if(x1<x2) swap(x1,x2); //if(y1<y2) swap(y1,y2); if ((x[num]>x1||x[num]<x2)||(y[num]>y1||y[num]<y2)) { return true; } return false; } inline bool inner(vector<int> x, vector<int> y,int num,int x1,int x2,int y1,int y2) { //if(x1<x2) swap(x1,x2); //if(y1<y2) swap(y1,y2); if ((x[num]<=x1&&x[num]>=x2)&&(y[num]<=y1&&y[num]>=y2)) { return true; } return false; } int minimumCut(vector<int> x, vector<int> y, vector<int> h) { int n=x.size(); //sort the array by the height for (int i=0;i<n;i++) { for (int j=i+1;j<n;j++) { if (h[i]<h[j]) { int temp; temp=h[i];h[i]=h[j];h[j]=temp; temp=x[i];x[i]=x[j];x[j]=temp; temp=y[i];y[i]=y[j];y[j]=temp; } } } //enum the (x1,y1) (x2,y2) these are two vectexs on the rectangle int x1,x2,y1,y2; int ans=n; for (int i1=0;i1<n;i1++) { x1=x[i1]; for(int i2=0;i2<n;i2++) { x2=x[i2]; if (x1<x2) continue; for (int j1=0;j1<n;j1++) { y1=y[j1]; for (int j2=0;j2<n;j2++) { y2=y[j2]; if(y1<y2) continue; int now=2*((x1-x2)+(y1-y2)); int fence=0; int count=0; //enum the trees outside the fence for (int ii=0;ii<n;ii++) { if (outer(x,y,ii,x1,x2,y1,y2)==true) { fence+=h[ii]; count++; } } //enum the trees needed inside the fence for (int jj=0;jj<n&&fence<now;jj++) { if(inner(x,y,jj,x1,x2,y1,y2)==true) { fence+=h[jj]; count++; } } //adjust the ans if (count<ans) { ans = count; } } } } } return ans; } };  

带函数，超时！！！

#include<vector> #include <cmath> using namespace std; struct SaveTheTrees { int minimumCut(vector<int> x, vector<int> y, vector<int> h) { int n=x.size(); //sort the array by the height for (int i=0;i<n;i++) { for (int j=i+1;j<n;j++) { if (h[i]<h[j]) { int temp; temp=h[i];h[i]=h[j];h[j]=temp; temp=x[i];x[i]=x[j];x[j]=temp; temp=y[i];y[i]=y[j];y[j]=temp; } } } //enum the (x1,y1) (x2,y2) these are two vectexs on the rectangle int x1,x2,y1,y2; int ans=n; for (int i1=0;i1<n;i1++) { x1=x[i1]; for(int i2=0;i2<n;i2++) { x2=x[i2]; if (x1<x2) continue; for (int j1=0;j1<n;j1++) { y1=y[j1]; for (int j2=0;j2<n;j2++) { y2=y[j2]; if(y1<y2) continue; int now=2*((x1-x2)+(y1-y2)); int fence=0; int count=0; //enum the trees outside the fence for (int ii=0;ii<n;ii++) { if ((x[ii]>x1||x[ii]<x2)||(y[ii]>y1||y[ii]<y2)) { fence+=h[ii]; count++; } } //enum the trees needed inside the fence for (int jj=0;jj<n&&fence<now;jj++) { if((x[jj]<=x1&&x[jj]>=x2)&&(y[jj]<=y1&&y[jj]>=y2)) { fence+=h[jj]; count++; } } //adjust the ans if (count<ans) { ans = count; } } } } } return ans; } };