Codeforces Round #576 (Div. 2) D. Welfare State（线段树，or，思维）

Qo0

于 2019-08-14 17:14:55 发布

阅读量119

点赞数

分类专栏： Codeforces 思维

本文链接：https://blog.csdn.net/qq_41835683/article/details/99582881

版权

思维同时被 2 个专栏收录

30 篇文章 0 订阅

订阅专栏

Codeforces

29 篇文章 0 订阅

订阅专栏

题目链接：https://codeforc.es/contest/1199/problem/D

题意：有一个初始数组，有q次有顺序的操作，有两类操作，一种是1 p x，意思是把数组下标为p的元素变成x，

另一种操作是2 x，把数组中所有小于x的元素变成x，问q次操作之后的数组。

题解：可以用线段树，这里提供一种更为简单的 $O(n)$ 做法，

对于每一个1操作，记录下更改数组下标为i的元素的最后的操作序号，然后更改数组下标为i的元素的值， $s[index]=val;\ lastupdate[index]=i;$

对于每一个2操作，用 $mn$ 数组记录下第q次操作的x值， $mn[i]=x$

然后从后往前更新 $mn$ 数组。 $for(int \ i=q-1;i>=1;i--)mn[i]=max(mn[i],mn[i+1]);$

大值会覆盖覆盖前面的，小的不会对后面的造成影响。

最后一步，对每个元素更新最大值，

max{1操作的直接修改（因为我们实时修改，所以也就是 $s[i]$ ），2操作的 $mn[lastupdate[i]+1]$ }。

代码：

#pragma GCC optimize(2)
#include <bits/stdc++.h>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <vector>
#define inf 0x3f3f3f3f
#define Pair pair<int,int>
//#define int long long
#define fir first
#define sec second
namespace fastIO {
#define BUF_SIZE 100000
#define OUT_SIZE 100000
	//fread->read
	bool IOerror = 0;
	//inline char nc(){char ch=getchar();if(ch==-1)IOerror=1;return ch;}
	inline char nc() {
		static char buf[BUF_SIZE], * p1 = buf + BUF_SIZE, * pend = buf + BUF_SIZE;
		if (p1 == pend) {
			p1 = buf; pend = buf + fread(buf, 1, BUF_SIZE, stdin);
			if (pend == p1) { IOerror = 1; return -1; }
		}
		return *p1++;
	}
	inline bool blank(char ch) { return ch == ' ' || ch == '\n' || ch == '\r' || ch == '\t'; }
	template<class T> inline bool read(T& x) {
		bool sign = 0; char ch = nc(); x = 0;
		for (; blank(ch); ch = nc());
		if (IOerror)return false;
		if (ch == '-')sign = 1, ch = nc();
		for (; ch >= '0' && ch <= '9'; ch = nc())x = x * 10 + ch - '0';
		if (sign)x = -x;
		return true;
	}
	inline bool read(double& x) {
		bool sign = 0; char ch = nc(); x = 0;
		for (; blank(ch); ch = nc());
		if (IOerror)return false;
		if (ch == '-')sign = 1, ch = nc();
		for (; ch >= '0' && ch <= '9'; ch = nc())x = x * 10 + ch - '0';
		if (ch == '.') { double tmp = 1; ch = nc(); for (; ch >= '0' && ch <= '9'; ch = nc())tmp /= 10.0, x += tmp * (ch - '0'); }
		if (sign)x = -x; return true;
	}
	inline bool read(char* s) {
		char ch = nc();
		for (; blank(ch); ch = nc());
		if (IOerror)return false;
		for (; !blank(ch) && !IOerror; ch = nc())* s++ = ch;
		*s = 0;
		return true;
	}
	inline bool read(char& c) {
		for (c = nc(); blank(c); c = nc());
		if (IOerror) { c = -1; return false; }
		return true;
	}
	template<class T, class... U>bool read(T& h, U& ... t) { return read(h) && read(t...); }
#undef OUT_SIZE
#undef BUF_SIZE
};
using namespace fastIO;
using namespace std;
 
const int N = 2e5 + 5;
const double eps = 1e-10;
const double pi = acos(-1.0);
const int mod = 998244353;
/*---------------------------------------------------------------------------------------------------------------------------*/
struct Point{double x,y;Point(double x=0,double y=0):x(x),y(y){}};
typedef Point Vector;
Vector operator + (Vector A,Vector B){return Vector(A.x+B.x,A.y+B.y);}
Vector operator - (Point A,Point B){return Vector(A.x-B.x,A.y-B.y);}
Vector operator * (Vector A,double p){return Vector(A.x*p,A.y*p);}
Vector operator / (Vector A,double p){return Vector(A.x/p,A.y/p);}
bool operator < (const Point& A,const Point& B){return A.x<B.x || (A.x==B.x&&A.y<B.y);}
int dcmp(double x){if(fabs(x)<eps)return 0;else return x<0?-1:1;}
bool operator == (const Point& A,const Point& B){return dcmp(A.x-B.x)==0 && dcmp(A.y-B.y)==0;}
double Dot(Vector A,Vector B){return A.x*B.x+A.y*B.y;}
double Length(Vector A){return sqrt(Dot(A,A));}
double Dist2(const Point& A, const Point& B) {return (A.x-B.x)*(A.x-B.x) + (A.y-B.y)*(A.y-B.y);}
double Angle(Vector A,Vector B){return acos(Dot(A,B)/Length(A)/Length(B));}
double Cross(Vector A,Vector B){return A.x*B.y-A.y*B.x;}
double Area2(Point A,Point B,Point C){return Cross(B-A,C-A);}
double DistanceToLine(Point P,Point A,Point B){Vector v1=B-A,v2=P-A;return fabs(Cross(v1,v2))/Length(v1);}
Vector Normal(Vector A){double L=Length(A);return Vector(-A.y/L,A.x/L);}
Vector Rotate(Vector A,double rad){return Vector(A.x*cos(rad)-A.y*sin(rad),A.x*sin(rad)+A.y*cos(rad));}
Point GetLineIntersection(Point P,Vector v,Point Q,Vector w){Vector u=P-Q;double t=Cross(w,u)/Cross(v,w);return P+v*t;  }
double PolygonArea(vector<Point>p){//duo area
  double area=0;
  int n=p.size();
  for(int i=1;i<n-1;i++)area+=Cross(p[i]-p[0],p[i+1]-p[0]);
  return area/2;
}
double torad(double deg){return deg/180*acos(-1);}
vector<Point> ConvexHull(vector<Point>& p){
  sort(p.begin(), p.end());
  p.erase(unique(p.begin(), p.end()), p.end());
  int n=p.size();
  int m=0;
  vector<Point> ch(n+1);
  for(int i=0;i<n;i++){while(m>1&&Cross(ch[m-1]-ch[m-2], p[i]-ch[m-2])<=0)m--;ch[m++]=p[i];}
  int k=m;
  for(int i=n-2;i>=0;i--){while(m>k&&Cross(ch[m-1]-ch[m-2], p[i]-ch[m-2])<=0)m--;ch[m++]=p[i];}
  if(n>1)m--;
  ch.resize(m);
  return ch;
}
double diameter2(vector<Point>& points,Point& A,Point& B) {
  vector<Point>p=ConvexHull(points);
  int n=p.size();
  if(n==1) return 0;
  if(n==2) return Dist2(p[0],p[1]);
  //p.push_back(p[0]); // 免得取模
  double ans=0;
  for(int u=0,v=1;u<n;u++) {
    for(;;){
      //Cross(p[u+1]-p[u],p[v+1]-p[v])<=0时停止旋转
      int diff=Cross(p[u+1]-p[u], p[v+1]-p[v]);
      if(diff<=0){
        if(Dist2(p[u],p[v])>ans){
          ans=Dist2(p[u],p[v]); // u和v是对踵点
          A=p[u];B=p[v];
        }
        //if(diff==0) ans=max(ans,Dist2(p[u],p[v+1])); // diff==0 时u和v+1也是对踵点
        break;
      }
      v=(v+1)%n;
    }
  }
  return ans;
}
/*---------------------------------------------------------------------------------------------------------------------------*/
struct Line{
  Point P;
  Vector v;
  double ang;
  Line(){}
  Line(Point P,Vector v):P(P),v(v){ang=atan2(v.y,v.x);}
  bool operator < (const Line& L)const{
    return ang<L.ang;
  }
};
Point GetLineIntersection(const Line& a,const Line& b) {
  Vector u=a.P-b.P;
  double t=Cross(b.v, u)/Cross(a.v,b.v);
  return a.P+a.v*t;
}
bool OnLeft(Line L,Point p){return Cross(L.v,p-L.P)>0;}
vector<Point>HalfplaneIntersection(vector<Line>L) {
  int n=L.size();
  sort(L.begin(),L.end());
  int first,last;
  vector<Point> p(n);
  vector<Line> q(n);
  vector<Point> ans;
  q[first=last=0]=L[0];
  for(int i=1;i<n;i++) {
    while(first<last&&!OnLeft(L[i],p[last-1])) last--;
    while(first<last&&!OnLeft(L[i],p[first]))first++;
    q[++last]=L[i];
    if(fabs(Cross(q[last].v,q[last-1].v))<eps) {
      last--;
      if(OnLeft(q[last],L[i].P))q[last]=L[i];
    }
    if(first<last)p[last-1]=GetLineIntersection(q[last-1],q[last]);
  }
  while(first<last&&!OnLeft(q[first],p[last-1]))last--;//删除无用平面
  if(last-first<=1)return ans;
  p[last]=GetLineIntersection(q[last],q[first]);//计算首尾两个半平面的交点
  //从deque复制到输出中
  for(int i=first;i<=last;i++)ans.push_back(p[i]);
  return ans;
}
 
/*---------------------------------------------------------------------------------------------------------------------------*/
typedef long long ll;
int money[N];
int mn[N],lastup[N];
signed main() {
  int n;
  cin>>n;
  for(int i=1;i<=n;i++)
    cin>>money[i];
  int q;
  cin>>q;
  for(int i=1;i<=q;i++){
    int op;
    cin>>op;
    if(op==1){
      int index,val;
      cin>>index>>val;
      money[index]=val;
      lastup[index]=i;
    }
    else cin>>mn[i];
  }
  for(int i=q-1;i>=1;i--)mn[i]=max(mn[i],mn[i+1]);
  for(int i=1;i<=n;i++)cout<<max(money[i],mn[lastup[i]+1])<<" ";
  return 0;
}

Qo0

关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
Codeforces Round #576 (Div. 2) D. Welfare State（线段树，or，思维）

题目链接：https://codeforc.es/contest/1199/problem/D题意：有一个初始数组，有q次有顺序的操作，有两类操作，一种是1 p x，意思是把数组下标为p的元素变成x，另一种操作是2 x，把数组中所有小于x的元素变成x，问q次操作之后的数组。题解：可以用线段树，这里提供一种更为简单的做法，对于每一个1操作，记录下更改数组下标为i的元素的最后的操作序号...
复制链接

扫一扫