A题
#include <bits/stdc++.h>
#define lson rt<<1,l,mid
#define rson rt<<1|1,mid+1,r
using namespace std;
typedef long long ll;
const int maxn=1e5+5;
const int INF=0x3f3f3f3f;
int k,n,h,m=1,mn[maxn<<2],prf[maxn],he[maxn];
void update(int rt,int l,int r,int x,int val){
if(l==r){
mn[rt]=val;
return;
}
int mid=(l+r)>>1;
if(x<=mid)update(lson,x,val);
else update(rson,x,val);
mn[rt]=min(mn[rt<<1],mn[rt<<1|1]);
}
int query(int rt,int l,int r,int x,int y){
if(x<=l&&r<=y)return mn[rt];
int mid=(l+r)>>1,ans=INF;
if(x<=mid)ans=min(ans,query(lson,x,y));
if(y>mid)ans=min(ans,query(rson,x,y));
return ans;
}
int main(){
scanf("%d%d",&k,&n);
for(int i=0,x,y;i<n;i++){
scanf("%d%d",&x,&y);
if(i<k){
update(1,0,k-1,i,x+y);he[i]++;
continue;
}
if(mn[1]>x) continue;
int d = i % k,l,r,ans;
int you=query(1,0,k-1,d,k-1);
if(you<=x)
l=d,r=k-1;
else
l=0,r=d-1;
while(l<=r){
int mid=(l+r)>>1;
if(query(1,0,k-1,l,mid)<=x) ans=mid,r=mid-1;
else l=mid+1;
}
update(1,0,k-1,ans,x+y),he[ans]++,m=max(m,he[ans]);
}
for(int i=0;i<k;i++)
if(he[i]==m)prf[++h]=i;
for(int i=1;i<=h;i++){
if(i!=1)printf(" ");
printf("%d",prf[i]);
}
}
D题
- 思路
看代码,按边权排序之后就相当于区间修改了;关键是要想到每一块都要联通,这样的话就相当于每个点和1都联通了。 - 代码
#include<bits/stdc++.h>
#define lson rt<<1,l,mid
#define rson rt<<1|1,mid+1,r
#define ll long long
using namespace std;
const int maxn = 1e5+5;
const int INF = 0x3f3f3f3f;
int t,n,m,c,mn[maxn<<2],lazy[maxn<<2];
struct node
{
int l,r,w;
}e[maxn];
bool cmp(node a,node b)
{
return a.w > b.w;
}
void pushdown(int rt)
{
if(lazy[rt]){
mn[rt<<1] = mn[rt];
mn[rt<<1|1] = mn[rt];
lazy[rt<<1] = lazy[rt];
lazy[rt<<1|1] = lazy[rt];
lazy[rt] = 0;
}
}
void update(int rt,int l,int r,int x,int y,int val)
{
if(x <= l&&r <= y){
mn[rt] = val;lazy[rt] = val;
return;
}
int mid = (l+r)>>1;
pushdown(rt);
if(x <= mid) update(lson,x,y,val);
if(y > mid) update(rson,x,y,val);
}
int query(int rt,int l,int r,int x)
{
if(l == r ) return mn[rt];
int mid = (l+r)>>1;
pushdown(rt);
if(x <= mid) return query(lson,x);
else return query(rson,x);
}
int main()
{
scanf("%d",&t);
while(t--){
ll he = 0,sum = 0,f = 0;
scanf("%d%d",&n,&m);
memset(mn,INF,sizeof(mn));
memset(lazy,0,sizeof(lazy));
for(int i=1;i<=m;i++){
scanf("%d%d%d",&e[i].l,&e[i].r,&e[i].w);
he += 1ll*e[i].w*(e[i].r-e[i].l+1)*(e[i].r-e[i].l)/2;
}
sort(e+1,e+1+m,cmp);
for(int i = 1;i <= m;i++){
update(1,1,n-1,e[i].l,e[i].r-1,e[i].w);
}
for(int i=1;i<n;i++){
int h = query(1,1,n-1,i);
if( h == INF) f=1;
sum += h;
}
printf("Case #%d: ",++c);
if(f) printf("Gotta prepare a lesson");
else printf("%lld",he - sum);
if(t) printf("\n");
}
}
借鉴