HDU 6092 Rikka with Subset(思维)

最新推荐文章于 2019-07-27 09:06:09 发布

m0_37802215

最新推荐文章于 2019-07-27 09:06:09 发布

阅读量221

点赞数

分类专栏： acm 补题多校训练 hdu 文章标签： acm 思维

本文链接：https://blog.csdn.net/m0_37802215/article/details/78066693

版权

acm 同时被 3 个专栏收录

87 篇文章 0 订阅

订阅专栏

补题

41 篇文章 0 订阅

订阅专栏

多校训练

12 篇文章 0 订阅

订阅专栏

看了题解..
感觉自己一天比一天菜啊..要菜破天际了..
希望明天别太丢人.
就是一个递推..
我就是没想到如何简单的刨除一个数字..
b[j] -= b[j-i].
这样就刨除了..

/*  xzppp  */
#include <iostream>
#include <vector>
#include <cstdio>
#include <string.h>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
#include <stack>
#include <list>
#include <string>
#include <cmath>
#include <bitset>
#include <iomanip>
using namespace std;
#define FFF freopen("in.txt","r",stdin);freopen("out.txt","w",stdout);
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define MP make_pair
#define PB push_back
#define _ %MOD
#define MST(x) memset((x),0,sizeof(x))
typedef long long  LL;
typedef unsigned long long ULL;
typedef pair<int,int > pii;
typedef pair<LL,LL> pll;
typedef pair<double,double > pdd;
typedef pair<double,int > pdi;
const int MAXN = 1e4+17;
const int MAXM = 1e6+17;
const int MAXV = 2*1e3+17;
const int BIT = 15+3;
const int INF = 0x7f7f7fff;
const LL INFF = 0x3f3f3f3f3f3f3f3f;
const int MOD = 1e9+7;
template <class T>  
inline bool scan_d(T &ret){  
    char c;  
    int sgn;  
    if(c=getchar(),c==EOF)  return 0;//EOF  
    while(c!='-'&&(c<'0'&&c>='9'))  c=getchar();  
    sgn=(c=='-')?-1:1;  
    ret=(c=='-')?0:(c-'0');  
    while(c=getchar(),c>='0'&&c<='9')   ret=ret*10+(c-'0');  
    ret*=sgn;  
    return 1;  
}  
inline void out(int x){  
    if(x>9) out(x/10);  
    putchar(x%10+'0');  
}  
int a[MAXN];
int main()
{
    #ifdef GoodbyeMonkeyKing
    FFF
    #endif 
    int t;
    cin>>t;
    while(t--)
    {
        int n,m;
        cin>>n>>m;
        for (int i = 0; i <= m; ++i)
        {
            scanf("%d",a+i);
        }
        vector<int > ans;
        for (int i = 0; i <= m; ++i)
        {
            if(a[i]==0||i==0) continue;
            ans.push_back(i);
            for (int j = i; j <= m; ++j)
            {
                a[j] -= a[j-i];
            }
            i--;
        }
        for (int i = 0; i < ans.size(); ++i)
        {
            out(ans[i]);
            if(i!=ans.size()-1)printf(" ");
        }
        cout<<endl;
    }
    return 0;
}