//如果不慌應該比賽是能想出來的
#include <iostream> #include <algorithm> #include <stdio.h> #include <set> #include <queue> #include <cstring> #include <string> #include <limits.h> #include <string.h> #include <vector> #include <map> #define LL long long #define INF 2100000000 #define fi first #define se second #define lowbit(x) (x&(-x)) #define eps 5e-7 using namespace std; const int maxn=(int)3e5 +10; const int maxm=(int)2510; const LL MOD=(LL)1e9+7; int n; struct nod{int x,y;LL z;void in(){scanf("%d%I64d%d",&x,&z,&y);y+=x;}nod(){}nod(int x,int y,LL z):x(x),y(y),z(z){}bool operator <(const nod&a)const{return y==a.y&&x<a.x||y<a.y;} }; nod f[maxn]; int main() { #ifdef shuaishuaifreopen("C:\\Users\\hasee\\Desktop\\a.txt","r",stdin);//freopen("C:\\Users\\hasee\\Desktop\\b.txt","w",stdout); #endifint n;scanf("%d",&n);for(int i=0;i<n;i++ ){f[i].in();}sort(f,f+n) ;for(int i=1;i<n;i++){if(f[i].x>=f[i-1].y)f[i].z+=f[i-1].z;else{int k=upper_bound(f,f+i,nod(f[i].x,f[i].x,0))-f-1;f[i].z=max(f[i-1].z,f[k].z+f[i].z);}}printf("%I64d\n",f[n-1].z);return 0; }

?

//優秀的標程啊 不過我留了個bug在里面 =。=
int n; struct nod{int t;LL s;int idx;nod(){}nod(int t,LL s,int idx):t(t),s(s),idx(idx){}bool operator <(const nod&a)const {return t<a.t;} }; vector<nod> q; LL st[maxn]; int main() { #ifdef shuaishuaifreopen("C:\\Users\\hasee\\Desktop\\a.txt","r",stdin);//freopen("C:\\Users\\hasee\\Desktop\\b.txt","w",stdout); #endifint x,y;LL s;scanf("%d",&n);q.reserve(2*n);for(int i=0;i<n;i++){scanf("%d%I64d%d",&x,&s,&y);q.push_back(nod(x,0,i));q.push_back(nod(x+y,s,i));}sort(q.begin(),q.end());LL val=0;for(int i=0;i<q.size();i++){if(q[i].s==0)st[q[i].idx]=val;else{val=max(val,st[q[i].idx]+q[i].s);}// for(int i=0;i<n;i++)printf("%lld ",st[i]);printf("\n"); }printf("%I64d\n",val);return 0; }

?

轉載于:https://www.cnblogs.com/MeowMeowMeow/p/7486396.html

總結

以上是生活随笔為你收集整理的Surf Gym - 100819S的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。