c2:Increasing Subsequence (hard version)
那边小取那边，然后相等比较后面的长度
#include<bits/stdc++.h>using namespace std;#define maxn 500005int a[maxn];int main(){ ,in; scanf("%d",&n); ;j<n;j++){ scanf("%d",&a[j]); if(mx<a[j]){ mx = a[j]; in = j; } } string s=""; ,r = n-,k=-; while(l<=r){ if(k<min(a[l],a[r])){ if(a[l]<a[r]){ s+="L"; k=a[l]; l++; }else if(a[l]>a[r]){ s+='R'; k=a[r]; r--; }else{ ,x=k; ,y=k; for(int i = l;i<=in;i++){ if(a[i]>x){ x = a[i]; res1++; }else break; } for(int i = r;i>=in;i--){ if(a[i]>y){ y = a[i]; res2++; }else break; } if(res1>res2){ k = a[l]; l++; s+='L'; }else{ k = a[r]; r--; s+='R'; } } }else if(k<a[l]){ s+='L'; k = a[l]; l++; }else if(k<a[r]){ s+='R'; k = a[r]; r--; }else break; } cout<<s.size()<<endl; cout<<s<<endl;}
#include<bits/stdc++.h>using namespace std;#define maxn 500005#define LL long longLL a[maxn];int main(){ LL n,m; scanf(;j<m;j++){ a[j] = (n - (m - j) * (m - -j) / ) / (m-j); //cout<<a[j]<<endl; &&a[j]>a[j-]*){ a[j]=a[j-]*; } n-=a[j]; ){ cout<<"NO"<<endl; ; } } if(n){ cout<<"NO"<<endl; ; } cout<<"YES"<<endl; ;j<m;j++){ cout<<a[j]<<" "; }}
#include<bits/stdc++.h>using namespace std;#define maxn 500005#define LL long longint a[maxn];map<int,int>mp;set<int>s;vector<int>Q;int main(){ int n; cin>>n; ;j<n;j++){ cin>>a[j]; } ;j<n;j++){ int x; cin>>x; mp[x]++; s.insert(x); } ;j<n;j++){ int x = (n-a[j])%n; set<int> ::iterator it = s.lower_bound(x); if(it==s.end()){ it=s.begin(); } ){ mp[*it]--; cout<<(*it+a[j])%n<<" "; } ){ s.erase(it); } }}
#include<bits/stdc++.h>using namespace std;#define maxn 500005#define LL long longint a[maxn];map<int,int>mp;set<int>s;vector<int>q,w;int main(){ int n; cin>>n; ;j<n;j++){ scanf("%d",&a[j]); mp[a[j]]++; q.push_back(a[j]); } sort(q.begin(),q.end()); q.erase(unique(q.begin(),q.end()),q.end()); ,mx = ,res = ,r=-; ;j<q.size();j++){ ){ res+=mp[q[j]]; if(res>mx){ mx = res; r = j; } }else{ ]+){ ){ res+=mp[q[j]]; if(res>mx){ mx = res; r = j; } }else{ res+=mp[q[j]]; if(res>mx){ mx = res; r = j; } res = mp[q[j]]; } }else{ res=mp[q[j]]; if(res>mx){ mx = res; r = j; } } } }// if(mx==21){// cout<<q[r]<<endl;// }// cout<<mx<<" "<<r<<endl; int s = mp[q[r]]; ;j>=;j--){ !=q[j+]){ l=j+; break; }else{ s+=mp[q[j]]; if(s==mx){ l=j; break; } } }// cout<<l<<endl; for(int j=l;j<=r;j++){ ){ w.push_back(q[j]); mp[q[j]]--; } } for(int j=r;j>=l;j--){ w.push_back(q[j]); } cout<<w.size()<<endl; ;j<w.size();j++){ cout<<w[j]<<" "; }}
