2017 Multi-University Training Contest 5 hdu 6092

HDU - 6092

思路：

 

AC代码：

#include "iostream"
#include "string.h"
#include "stack"
#include "queue"
#include "string"
#include "vector"
#include "set"
#include "map"
#include "algorithm"
#include "stdio.h"
#include "math.h"
#pragma comment(linker, "/STACK:102400000,102400000")
#define ll long long
#define endl ("\n")
#define bug(x) cout<<x<<" "<<"UUUUU"<<endl;
#define mem(a,x) memset(a,x,sizeof(a))
#define mp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define ft (frist)
#define sd (second)
#define lrt (rt<<1)
#define rrt (rt<<1|1)
using namespace std;
const long long INF = 1e18+1LL;
const int inf = 1e9+1e8;
const int N=1e5+100;
const ll mod=1e9+7;

ll n,m,b[N],ans[N];
int main(){
    ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    int T; cin>>T;
    while(T--){
        cin>>n>>m;
        mem(b,0), mem(ans,0);
        for(int i=0; i<=m; ++i){
            cin>>b[i];
        }
        for(int i=1; i<=m; ++i){
            if(b[i]!=0){
                ans[i]+=b[i];
                for(int k=1; k<=ans[i]; ++k){
                    for(int j=i; j<=m; ++j){
                        b[j]-=b[j-i];
                    }
                }
            }
        }
        int ff=0;
        for(int i=1; i<=m; ++i){
            if(ans[i]!=0){
                for(int _=1; _<=ans[i]; ++_){
                    if(ff) cout<<" "<<i;
                    else cout<<i;
                    ff=1;
                }
            }
        }
        cout<<endl;
    }
    return 0;
}

 

转载于:https://www.cnblogs.com/max88888888/p/7420857.html