codeforces253B - Physics Practical

標籤：style   blog   http   color   os   io   2014   art   

題意：給你一個集合，問你集合裡面刪多少個數字才滿足最大值小於等於最小值的兩倍

解題思路：hs+dp

解題代碼：

 1 // File Name: 253b.cpp 2 // Author: darkdream 3 // Created Time: 2014年07月24日 星期四 16時24分14秒 4  5 #include<vector> 6 #include<list> 7 #include<map> 8 #include<set> 9 #include<deque>10 #include<stack>11 #include<bitset>12 #include<algorithm>13 #include<functional>14 #include<numeric>15 #include<utility>16 #include<sstream>17 #include<iostream>18 #include<iomanip>19 #include<cstdio>20 #include<cmath>21 #include<cstdlib>22 #include<cstring>23 #include<ctime>24 25 using namespace std;26 int n; 27 int ans[5005];28 int hs[5005];29 int main(){30     int n; 31     freopen("input.txt","r",stdin);32     freopen("output.txt","w",stdout);33     scanf("%d",&n);34     memset(hs,0,sizeof(hs));35     for(int i =1;i<=n;i ++)36     {37       int temp ; 38       scanf("%d",&temp);39       hs[temp] ++ ; 40     }41     int minn = 1e8;42     ans[0] = 0;43     for(int i =1;i <= 5000 ;i ++)44         ans[i] = ans[i-1]+ hs[i];45     for(int i=1 ;i<= 2500 ;i ++) 46     {47        minn = min(ans[i-1] + (ans[5000] - ans[2*i]),minn);48     }49     printf("%d\n",minn);50 return 0;51 }

View Code