Codeforces Round #757 (Div. 2)

A. Divan and a Store

题目：

 

思路分析：

暴力或者直接二分缩区间都行

代码实现：

#include<iostream>
#include<cstdio>
#include<string>
#include<queue>
#include<stack>
#include<map>
#include<vector>
#include<list>
#include<set>
#include<iomanip>
#include<cstring>
#include<cctype>
#include<cmath>
#include<cstdlib>
#include<ctime>
#include<cassert>
#include<sstream>
#include<algorithm>
using namespace std;
typedef long long  ll;
#define re register //局部
#define PI atan(1.0)*4
#define ull unsigned long long
#define scf(n) scanf("%d",&n)
#define scfl(n) scanf("%lld",&n)
#define prf(n) printf("%d",n)
#define prfl(n) printf("%lld",n)
#define scfd(n) scanf("%lf",&n)
#define prfd(n) printf("%.lf",n)
#define prf10(n) printf("%.10f",n)
#define ls (rt<<1)
#define rs (rt<<1|1)
//#define mid (l+r)/2
#define mms(x, y) memset(x, y, sizeof x)
#define over(i,s,t) for(register long long i=s;i<=t;++i)
#define lver(i,t,s) for(register long long i=t;i>=s;--i)
const int INF = 0x3f3f3f3f;
const double EPS=1e-10;
const double Pi=3.1415926535897;
using namespace std;


const int MAX=1e5+10;
int t;
int n;
ll l,r,k;
int v[MAX];
int main(){
    int t;
    cin>>t;
    while (t--) {
        cin>>n>>l>>r>>k;
        for(int i=0;i<n;i++){
            cin>>v[i];
        }
        sort(v,v+n);
//        for(int i=0;i<n;i++){
//            cout<<v[i]<<" ";
//        }
//        cout<<endl;
        int ans=0;
        ll ll=lower_bound(v,v+n,l)-v;
//        cout<<ll<<endl;
        for(int i=ll;i<n;i++){
            if(v[i]>r){
                break;
            }
            if(k>=v[i]){
                k-=v[i];
                ans++;
            }
            else break;
        }
        cout<<ans<<endl;
    }
}

B. Divan and a New Project

题目：

思路分析：

题意就是给你n个要去医院的次数 起点是自己定

就是一道贪心构造

总部定为原点0

先按要去医院的次数排序 在0的左右依次放就行

代码实现：

#include<iostream>
#include<cstdio>
#include<string>
#include<queue>
#include<stack>
#include<map>
#include<vector>
#include<list>
#include<set>
#include<iomanip>
#include<cstring>
#include<cctype>
#include<cmath>
#include<cstdlib>
#include<ctime>
#include<cassert>
#include<sstream>
#include<algorithm>
using namespace std;
typedef long long  ll;
#define re register //局部
#define PI atan(1.0)*4
#define ull unsigned long long
#define scf(n) scanf("%d",&n)
#define scfl(n) scanf("%lld",&n)
#define prf(n) printf("%d",n)
#define prfl(n) printf("%lld",n)
#define scfd(n) scanf("%lf",&n)
#define prfd(n) printf("%.lf",n)
#define prf10(n) printf("%.10f",n)
#define ls (rt<<1)
#define rs (rt<<1|1)
//#define mid (l+r)/2
#define mms(x, y) memset(x, y, sizeof x)
#define over(i,s,t) for(register long long i=s;i<=t;++i)
#define lver(i,t,s) for(register long long i=t;i>=s;--i)
const int INF = 0x3f3f3f3f;
const double EPS=1e-10;
const double Pi=3.1415926535897;
using namespace std;


const int MAX=2e5+10;
int t;
struct node{
    ll a,b,c;
}v[MAX];
bool cmp(node a,node b){
    return a.b>b.b;
}
bool cmp1(node a,node b){
    return a.a<b.a;
}
int main(){
    cin>>t;
    while (t--) {
        ll n;
        cin>>n;
        for(int i=1;i<=n;i++){
            v[i].a=i;
            cin>>v[i].b;
        }
        sort(v+1,v+1+n,cmp);
        ll l=1;
        ll r=-1;
        ll ans=0;
        for(int i=1;i<=n;i++){
            if(l==-r){
                v[i].c=l;
                l++;
            }
            else {
                v[i].c=r;
                r--;
            }
            ans+=abs(v[i].c)*v[i].b;
        }
        sort(v+1,v+1+n,cmp1);
        cout<<ans*2<<endl;
        cout<<0<<" ";
        for(int i=1;i<=n;i++){
            cout<<v[i].c<<" ";
   
        }
        cout<<endl;
    }
    
}