cf 204 div2 C Jeff and Rounding 模擬
智商題,如果沒有0就很簡單,一半加一半減,恒定的,和選擇無關。有0的話就可以選擇和某些配對,於是就可以更改加減次數。而枚舉加減次數即可,比賽時就沒想清楚這一點。具體見代碼
/* author:jxy lang:C/C++ university:China,Xidian University **If you need to reprint,please indicate the source** */ #include <iostream> #include <cstdio> #include <cstdlib> #include <cmath> #include <cstring> #include <algorithm> using namespace std; int abs(int a) { return a>0?a:-a; } int main() { int n,N; while(~scanf("%d",&n)) { N=n<<1; int i,j,t,sum=0,zero=0; for(i=0;i<N;i++) { scanf("%*d.%d",&t); sum-=t; zero+=(t==0); } sum+=1000*n; int mi=max(0,zero-n),ma=min(zero,n); int ans=1000000000; for(int i=mi;i<=ma;i++) { ans=min(ans,abs(sum-i*1000)); } printf("%.3f\n",ans/1000.0); } }
最後更新:2017-04-03 14:53:50