SOS--DP（基础版本）未压缩空间 

  1 #define IOS ios_base::sync_with_stdio(0); cin.tie(0);
  2 #include <cstdio>//sprintf islower isupper
  3 #include <cstdlib>//malloc  exit strcat itoa system("cls")
  4 #include <iostream>//pair
  5 #include <fstream>//freopen("C:\\Users\\13606\\Desktop\\草稿.txt","r",stdin);
  6 #include <bitset>
  7 //#include <map>
  8 //#include<unordered_map>
  9 #include <vector>
 10 #include <stack>
 11 #include <set>
 12 #include <string.h>//strstr substr
 13 #include <string>
 14 #include <time.h>//srand(((unsigned)time(NULL))); Seed n=rand()%10 - 0~9;
 15 #include <cmath>
 16 #include <deque>
 17 #include <queue>//priority_queue<int, vector<int>, greater<int> > q;//less
 18 #include <vector>//emplace_back
 19 //#include <math.h>
 20 //#include <windows.h>//reverse(a,a+len);// ~ ! ~ ! floor
 21 #include <algorithm>//sort + unique : sz=unique(b+1,b+n+1)-(b+1);+nth_element(first, nth, last, compare)
 22 using namespace std;//next_permutation(a+1,a+1+n);//prev_permutation
 23 //******************
 24 int abss(int a);
 25 int lowbit(int n);
 26 int Del_bit_1(int n);
 27 int maxx(int a,int b);
 28 int minn(int a,int b);
 29 double fabss(double a);
 30 void swapp(int &a,int &b);
 31 clock_t __STRAT,__END;
 32 double __TOTALTIME;
 33 void _MS(){__STRAT=clock();}
 34 void _ME(){__END=clock();__TOTALTIME=(double)(__END-__STRAT)/CLOCKS_PER_SEC;cout<<"Time: "<<__TOTALTIME<<" s"<<endl;}
 35 //***********************
 36 #define rint register int
 37 #define fo(a,b,c) for(rint a=b;a<=c;++a)
 38 #define fr(a,b,c) for(rint a=b;a>=c;--a)
 39 #define mem(a,b) memset(a,b,sizeof(a))
 40 #define pr printf
 41 #define sc scanf
 42 #define ls rt<<1
 43 #define rs rt<<1|1
 44 typedef long long ll;
 45 const double E=2.718281828;
 46 const double PI=acos(-1.0);
 47 //const ll INF=(1LL<<60);
 48 const int inf=(1<<30);
 49 const double ESP=1e-9;
 50 const int mod=(int)1e9+7;
 51 const int N=(int)6e6+10;
 52 
 53 int a[N];
 54 int dp[N][40];//表示只有和mask后i位不同的子集;
 55 
 56 int main()
 57 {
 58     int n;
 59     sc("%d",&n);
 60     for(int i=1;i<=n;++i)
 61         sc("%d",&a[i]),dp[i][0]=a[i];
 62     for(int i=0;i<=(1<<21);++i)
 63     {
 64         for(int j=1;j<=22;++j)
 65         {
 66             int pos=j-1;
 67             if((i>>pos)&1)    dp[i][j]=dp[i][j-1]+dp[i^(1<<pos)][j-1];
 68             else            dp[i][j]=dp[i][j-1];
 69         }
 70     }
 71     return 0;
 72 }
 73 
 74 /**************************************************************************************/
 75 
 76 int maxx(int a,int b)
 77 {
 78     return a>b?a:b;
 79 }
 80 
 81 void swapp(int &a,int &b)
 82 {
 83     a^=b^=a^=b;
 84 }
 85 
 86 int lowbit(int n)
 87 {
 88     return n&(-n);
 89 }
 90 
 91 int Del_bit_1(int n)
 92 {
 93     return n&(n-1);
 94 }
 95 
 96 int abss(int a)
 97 {
 98     return a>0?a:-a;
 99 }
100 
101 double fabss(double a)
102 {
103     return a>0?a:-a;
104 }
105 
106 int minn(int a,int b)
107 {
108     return a<b?a:b;
109 }

 

posted @ 2019-09-30 21:45  ZMWLxh  阅读(288)  评论(0)    收藏  举报