P1484 种树（堆）

Posted 2022-11-21 oneman233

堆优化的贪心，考虑种一棵树的最大收益，种了当前树两旁的树之后的收益为a[i-1]+a[i+1]-a[i]

用双向链表维护住左右关系，大根堆则可以“反悔”，维护另一个记录某个坑能不能种树的数组即可

代码：

#include <bits/stdc++.h>
#define int long long
#define sc(a) scanf("%lld",&a)
#define scc(a,b) scanf("%lld %lld",&a,&b)
#define sccc(a,b,c) scanf("%lld %lld %lld",&a,&b,&c)
#define scs(a) scanf("%s",a) 
#define schar(a) scanf("%c",&a)
#define pr(a) printf("%lld",a)
#define fo(i,a,b) for(int i=a;i<b;++i)
#define re(i,a,b) for(int i=a;i<=b;++i)
#define rfo(i,a,b) for(int i=a;i>b;--i)
#define rre(i,a,b) for(int i=a;i>=b;--i)
#define prn() printf("\n")
#define prs() printf(" ")
#define mkp make_pair
#define pii pair<int,int>
#define pub(a) push_back(a)
#define pob() pop_back()
#define puf(a) push_front(a)
#define pof() pop_front()
#define fst first
#define snd second
#define frt front()
#define bak back()
#define mem0(a) memset(a,0,sizeof(a))
#define memmx(a) memset(a,0x3f3f,sizeof(a))
#define memmn(a) memset(a,-0x3f3f,sizeof(a))
#define debug
#define db double
#define yyes cout<<"YES"<<endl;
#define nno cout<<"NO"<<endl;
using namespace std;
typedef vector<int> vei;
typedef vector<pii> vep;
typedef map<int,int> mpii;
typedef map<char,int> mpci;
typedef map<string,int> mpsi;
typedef deque<int> deqi;
typedef deque<char> deqc;
typedef priority_queue<int> mxpq;
typedef priority_queue<int,vector<int>,greater<int> > mnpq;
typedef priority_queue<pii> mxpqii;
typedef priority_queue<pii,vector<pii>,greater<pii> > mnpqii;
const int maxn=500005;
const int inf=0x3f3f3f3f3f3f3f3f;
const int MOD=100000007;
const db eps=1e-10;
int qpow(int a,int b)int tmp=a%MOD,ans=1;while(b)if(b&1)ans*=tmp,ans%=MOD;tmp*=tmp,tmp%=MOD,b>>=1;return ans;
int lowbit(int x)return x&-x;
int max(int a,int b)return a>b?a:b;
int min(int a,int b)return a<b?a:b;
int mmax(int a,int b,int c)return max(a,max(b,c));
int mmin(int a,int b,int c)return min(a,min(b,c));
void mod(int &a)a+=MOD;a%=MOD;
bool chk(int now)
int half(int l,int r)while(l<=r)int m=(l+r)/2;if(chk(m))r=m-1;else l=m+1;return l;
int ll(int p)return p<<1;
int rr(int p)return p<<1|1;
int mm(int l,int r)return (l+r)/2;
int lg(int x)if(x==0) return 1;return (int)log2(x)+1;
bool smleql(db a,db b)if(a<b||fabs(a-b)<=eps)return true;return false;
bool bigeql(db a,db b)if(a>b||fabs(a-b)<=eps)return true;return false;
bool eql(db a,db b)if(fabs(a-b)<eps) return 1;return 0;
db len(db a,db b,db c,db d)return sqrt((a-c)*(a-c)+(b-d)*(b-d));
bool isp(int x)if(x==1)return false;if(x==2)return true;for(int i=2;i*i<=x;++i)if(x%i==0)return false;return true;
inline int read()
    char ch=getchar();int s=0,w=1;
    while(ch<48||ch>57)if(ch==‘-‘)w=-1;ch=getchar();
    while(ch>=48&&ch<=57)s=(s<<1)+(s<<3)+ch-48;ch=getchar();
    return s*w;

inline void write(int x)
    if(x<0)putchar(‘-‘),x=-x;
    if(x>9)write(x/10);
    putchar(x%10+48);

int gcd(int a, int b)
    if(a==0) return b;
    if(b==0) return a;
    if(!(a&1)&&!(b&1)) return gcd(a>>1,b>>1)<<1;
    else if(!(b&1)) return gcd(a,b>>1);
    else if(!(a&1)) return gcd(a>>1,b);
    else return gcd(abs(a-b),min(a,b));

int lcm(int x,int y)return x*y/gcd(x,y);

int n,k;
struct node
    int id,a;
    bool operator < (const node& o)constreturn a<o.a;
    node(int x,int y)id=x,a=y;
;
priority_queue<node> q;
int l[maxn],r[maxn],a[maxn];
bool vis[maxn];

signed main()
    ios_base::sync_with_stdio(0);
    cin.tie(0),cout.tie(0);
    cin>>n>>k;
    re(i,1,n)
        cin>>a[i];
        q.push(node(i,a[i]));
        l[i]=i-1;
        r[i]=i+1;
    
    l[n+1]=n,r[0]=1;
    int ans=0;
    while(k--)
        while(vis[q.top().id]) q.pop();
        node t=q.top();
        q.pop();
        if(t.a<0) break;
        ans+=t.a;
        int i=t.id;
        a[i]=a[l[i]]+a[r[i]]-a[i];
        t.a=a[i];
        vis[l[i]]=vis[r[i]]=1;
        l[i]=l[l[i]];
        r[i]=r[r[i]];
        r[l[i]]=i;
        l[r[i]]=i;
        q.push(t);
    
    cout<<ans;
    return 0;