#include<bits/stdc++.h>
#define mp make_pair
#define pi pair<int,int>
using namespace std;
const int dx[4]={-1,1,0,0};
const int dy[4]={0,0,-1,1};
int f[60][60][60],v[60][60],a[60][60],bx,by,ex,ey,n,m,l;
pi q[2000010];
char s[60];void bfs(int k)
{int h=1,r=0;for (int i=1; i<=n; i++)for (int j=1; j<=m; j++)if (a[i][j]){q[++r]=mp(i,j);v[i][j]=1;}while (h<=r){int i=q[h].first,j=q[h].second;v[i][j]=0; h++;for (int w=0; w<4; w++){int x=i+dx[w],y=j+dy[w];if (!a[x][y]) continue;if (f[x][y][k]>f[i][j][k]+1){f[x][y][k]=f[i][j][k]+1;if (!v[x][y]){q[++r]=mp(x,y);v[x][y]=1;}}}}
}int main()
{scanf("%d%d",&n,&m);for (int i=1; i<=n; i++){scanf("%s",s+1);for (int j=1; j<=m; j++){if (s[j]!='#') a[i][j]=1;if (s[j]=='R'){bx=i;by=j;}if (s[j]=='E'){ex=i;ey=j;}}}scanf("%s",s+1);l=strlen(s+1);for (int i=1; i<=n; i++)for (int j=1; j<=m; j++)for (int k=0; k<=l+1; k++) f[i][j][k]=1e9;int ans=1e9;f[bx][by][0]=0;for (int k=1; k<=l+1; k++){bfs(k-1);ans=min(ans,f[ex][ey][k-1]);if (k==l+1) break;for (int i=1; i<=n; i++)for (int j=1; j<=m; j++)if (a[i][j]){int pw;if (s[k]=='L') pw=2;if (s[k]=='R') pw=3;if (s[k]=='U') pw=0;if (s[k]=='D') pw=1;int x=i+dx[pw],y=j+dy[pw];if (a[x][y]) f[x][y][k]=min(f[i][j][k-1],f[x][y][k]);else f[i][j][k]=min(f[i][j][k-1],f[i][j][k]);f[i][j][k]=min(f[i][j][k-1]+1,f[i][j][k]);}}printf("%d\n",ans);
}

#include <bits/stdc++.h>
#define EPS 1.0e-9
#define PI acos(-1.0)
#define INF 30000000
#define MOD 1000000007
#define mem(a,b) memset((a),b,sizeof(a))
#define TS printf("!!!\n")
#define pb push_back
#define pai pair<int,int>
//using ll = long long;
//using ull= unsigned long long;
//std::ios::sync_with_stdio(false);
using namespace std;
//priority_queue<int,vector<int>,greater<int>> que;
typedef pair<int, int> pairint;
typedef long long ll;
typedef unsigned long long ull;
const int maxn = 100005;
ll mod = 1e9 + 7;
int a[maxn];
int num[maxn];
int main()
{// freopen("oddfactor.in", "r", stdin);// freopen("out.txt", "w", stdout);int n,k,r;int leftt;int rightt;leftt=rightt=1;int anser=0;int sum=0;mem(num,0);cin >> n >> k >> r;for(int i=1;i<=k;i++){scanf("%d",&a[i]);num[a[i]]++;}for(int i=1;i<=n;i++){if(num[i]){if(sum)leftt=rightt,rightt=i+1;elserightt=i,sum++;}if(sum==0&&i-leftt==r-2){rightt=i+1;anser++;sum++;}if(sum==1&&i-leftt==r-1){leftt=rightt;rightt=i+1;anser++;}}cout<<anser<<endl;return 0;
}

#include<bits/stdc++.h>using namespace std;
typedef long long ll;
const int mo=1e9+7;
int f[320][320][2][320];
ll d[320];
int a[320],n,k;void inc(int &a,int b)
{a+=b;if (a>mo) a-=mo;
}int dp(int i,int j,int p,int r)
{if (f[i][j][p][r]!=-1) return f[i][j][p][r];int s=-1,rr=r;if (i+j+p==0) s=k-r; //所有题都读过了else if (i+j+p<=n-k) //读过的题超过了k道
    {if (r) rr--; //先做最简单的else if (p==0) s=(i+j+k)*d[i+j]%mo;  //做当前考虑的这道并计算总的贡献
    }if (s==-1){s=0; //三种可能的读题情况if (i) s=1ll*i*dp(i-1,j,p,rr+1)%mo; if (j) inc(s,1ll*j*dp(i,j-1,p,rr)%mo);if (p) inc(s,dp(i,j,p-1,rr)%mo);}f[i][j][p][r]=s;return s;
}int main()
{memset(f,255,sizeof(f));d[0]=1;scanf("%d%d",&n,&k);for (int i=1; i<=n; i++)d[i]=d[i-1]*i%mo;for (int i=1; i<=n; i++)scanf("%d",&a[i]);sort(a+1,a+n+1);int ans=0;for (int i=1; i<=n; i++)ans=(ans+1ll*a[i]*dp(i-1,n-i,1,0)%mo)%mo;printf("%d\n",ans);
}

#include<bits/stdc++.h>using namespace std;
typedef long long ll;
struct po
{int x,y;friend bool operator <(po a,po b){if (a.x==b.x) return a.y<b.y;return a.x<b.x;}friend po operator -(po a,po b){return (po){a.x-b.x,a.y-b.y};}friend po operator +(po a,po b){return (po){a.x+b.x,a.y+b.y};}friend ll operator *(po a, po b){return 1ll*a.x*b.y-1ll*a.y*b.x;}
} p[100010],q[100010];
int n,k,t;
ll s[100010];int get(int l,int r,int i,int w)
{while (l<r){int m=(l+r)>>1;if ((q[m]-p[i])*(q[m+1]-p[i])*w>0) r=m;else l=m+1;}return l;
}int bord(int l,int r,int i,int w)
{while (l<r){int m=(l+r)>>1;if ((q[m].x-p[i].x)*w<0) l=m+1;else r=m;}return l;
}int main()
{scanf("%d%d",&n,&k);for (int i=1; i<=n; i++)scanf("%d%d",&p[i].x,&p[i].y);sort(p+1,p+1+k);q[1]=p[1]; t=1;for (int i=2; i<=k; i++){while (t>1&&(p[i]-q[t-1])*(q[t]-q[t-1])>=0) t--;q[++t]=p[i];}int m=t;for (int i=k-1;i;i--){while (t>m&&(p[i]-q[t-1])*(q[t]-q[t-1])>=0) t--;q[++t]=p[i];}for (int i=1; i<t; i++)s[i+1]+=s[i]+q[i]*q[i+1];ll ans=s[t],tmp;for (int i=k+1; i<=n; i++){if (p[i].x<q[1].x){int l=get(1,m,i,1), r=get(m,t,i,-1);tmp=s[r]-s[l]+q[r]*p[i]+p[i]*q[l];}else if (p[i].x>q[m].x){int l=get(1,m,i,-1),r=get(m,t,i,1);tmp=s[t]-s[r]+s[l]+q[l]*p[i]+p[i]*q[r];}else if ((q[m]-q[1])*(p[i]-q[1])>0){int mid=bord(m,t,i,-1);if (mid>m&&(q[mid]-q[mid-1])*(p[i]-q[mid-1])>0) continue;int l=mid>m?get(m,mid-1,i,-1):m;int r=get(mid,t,i,1);tmp=s[t]-s[r]+s[l]+q[l]*p[i]+p[i]*q[r];}else {int mid=bord(1,m,i,1);if (mid>1&&(q[mid]-q[mid-1])*(p[i]-q[mid-1])>0) continue;int l=(mid>1)?get(1,mid-1,i,-1):1;int r=get(mid,m,i,1);tmp=s[t]-s[r]+s[l]+q[l]*p[i]+p[i]*q[r];}ans=max(ans,tmp);}printf("%lld",ans/2);if (ans&1) puts(".5"); else puts(".0");
}方法一

#include <bits/stdc++.h>
#define MAXN 10005
using namespace std;
struct TwoSat{int dfn[MAXN * 2], low[MAXN * 2], dfs_ind = 1, sccno[MAXN * 2], scc_cnt = 0, w[MAXN * 2];vector<int> G[MAXN * 2];stack<int> st;void Add(int u, int v) {G[u].push_back(v);}void Tarjan(int u){dfn[u]=low[u]=dfs_ind++;st.push(u);for(int i=0; i < G[u].size(); i++){int v = G[u][i];if(!dfn[v]){Tarjan(v);low[u]=min(low[u],low[v]);}else if(!sccno[v]){low[u]=min(low[u],dfn[v]);}}if(dfn[u]==low[u]){scc_cnt++;while(true){int x=st.top();st.pop();sccno[x]=scc_cnt;w[scc_cnt]++;if(x==u)break;}}}bool Solve(int m) {for(int i = 1; i <= m * 2; i++) {if(!dfn[i]) {while(!st.empty())st.pop();Tarjan(i);}}for(int i = 1; i <= m; i++){if(sccno[i] == sccno[i + m]) {return false;}}return true;}
}twosat;
int n, r, l, x[MAXN], y[MAXN];
int main() {scanf("%d%d%d", &n, &r, &l);for(int i = 1; i <= l; i++) {scanf("%d%d", &x[i], &y[i]);}for(int i = 1; i <= l; i++) {for(int j = 1; j <= l; j++) {if(i == j) continue;if(x[i] == x[j] && abs(y[i] - y[j]) <= 2 * r) {twosat.Add(i + l, j);twosat.Add(j + l, i);}if(y[i] == y[j] && abs(x[i] - x[j]) <= 2 * r) {twosat.Add(i, j + l);twosat.Add(j, i + l);}}}if(twosat.Solve(l)) {printf("YES\n");}else {printf("NO\n");}return 0;
}

#include<bits/stdc++.h>using namespace std;
const int dx[4]={-1,1,0,0};
const int dy[4]={0,0,-1,1};
char s[100];
int f[1610],b[60][60],a[60][60],v[60][60],cy[1610],cx[1610],n,m,ans,t;
vector<int> g[1610];
void dfs(int i,int j)
{v[i][j]=1;for (int k=0; k<4; k++){int x=i+dx[k],y=j+dy[k];if (x==0||x>n||y>m||y==0) continue;if (v[x][y]) continue;if (a[x][y]==-1) a[x][y]=0;if (a[x][y]==1) dfs(x,y);}
}int work(int x)
{for (int i=0; i<g[x].size(); i++){int y=g[x][i];if (!f[y]){f[y]=1;if (!cy[y]||work(cy[y])){cx[x]=y;cy[y]=x;return 1;}}}return 0;
}int main()
{//freopen("1.in","r",stdin);scanf("%d%d",&n,&m);for (int i=1; i<=n; i++){scanf("%s",s+1);for (int j=1; j<=m; j++){if (s[j]=='W') a[i][j]=0;if (s[j]=='C') a[i][j]=-1;if (s[j]=='L') a[i][j]=1;}}for (int i=1; i<=n; i++)for (int j=1; j<=m; j++)if (!v[i][j]&&a[i][j]==1){ans++;dfs(i,j);}for (int i=1; i<=n; i++)for (int j=1; j<=m; j++)if (a[i][j]==-1) b[i][j]=++t;for (int i=1; i<=n; i++)for (int j=1; j<=m; j++)if ((i+j)%2==0){for (int k=0; k<4; k++){int x=i+dx[k],y=j+dy[k];if (b[x][y]) g[b[i][j]].push_back(b[x][y]);}}int s=0;for (int i=1; i<=t; i++)if (g[i].size()){if (!cx[i]){memset(f,0,sizeof(f));s+=work(i);}}printf("%d\n",ans+t-s);
}

#include <bits/stdc++.h>
#define EPS 1.0e-9
#define PI acos(-1.0)
#define INF 30000000
#define MOD 1000000007
#define mem(a,b) memset((a),b,sizeof(a))
#define TS printf("!!!\n")
#define pb push_back
#define pai pair<int,int>
//using ll = long long;
//using ull= unsigned long long;
//std::ios::sync_with_stdio(false);
using namespace std;
//priority_queue<int,vector<int>,greater<int>> que;
typedef pair<int, int> pairint;
typedef long long ll;
typedef unsigned long long ull;
const int maxn = 200005;
ll mod = 1e9 + 7;
struct node
{ll l;ll r;
}duan[maxn];
ll righ[maxn];
ll ans[maxn];
ll getit[maxn];
bool cmp(node a,node b)
{return b.r>a.r;
}
int main()
{// freopen("oddfactor.in", "r", stdin);// freopen("out.txt", "w", stdout);
        ll n,m;ll anser;ll cur;cin >> n >> m;for(int i=1;i<=m;i++)scanf("%lld %lld",&duan[i].l,&duan[i].r);sort(duan+1,duan+1+m,cmp);ll now=0;for(int i=1;i<=m;i++)righ[i]=duan[i].r;for(int i=1;i<=m;i++){cur=lower_bound(righ+1,righ+1+m,duan[i].l)-righ-1;ans[i]=min(ans[cur]+duan[i].l-duan[cur].r-1,ans[i-1]+duan[i].r-duan[i-1].r);}cout<<n+ans[m]-duan[m].r;return 0;
}

#include<math.h>
#include<string.h>
#include<iostream>
#include<algorithm>
#include<sstream> //istringstream stm(string); stm >> x;
#include<vector>
#define INF 2139062143
#define inf -2139062144
#define ll long long
using namespace std;
struct point {ll pos,letter;
};
bool cmp(point p1, point p2) {return p1.pos < p2.pos;
}
vector<point> pzheng,pfu;
int main() {ll n,k,i,j;scanf("%lld%lld",&n,&k);for(i=0; i<n; i++) {ll pos,x;scanf("%lld%lld",&pos,&x);if(pos >= 0) {pzheng.push_back({pos,x});} else {pfu.push_back({-pos,x});}}sort(pzheng.begin(),pzheng.end(),cmp);sort(pfu.begin(),pfu.end(),cmp);
//    for(i=0;i<pzheng.size();i++){
//        printf("%lld %lld\n",pzheng[i].pos,pzheng[i].letter);
//    }bool over = false;ll size = pzheng.size();ll cur = size - 1;ll ans = 0;if(size > 0) {while(!over) {if(pzheng[cur].letter > k) {ll time = pzheng[cur].letter / k;ans += time * pzheng[cur].pos * 2;pzheng[cur].letter -= time * k;if(pzheng[cur].letter == 0)    cur--;} else {ll send = k;ans += 2 * pzheng[cur].pos;while(send > 0 && cur >= 0) {ll last = pzheng[cur].letter;pzheng[cur].letter = max((ll)0,pzheng[cur].letter - send);send -= (last - pzheng[cur].letter);if(send > 0 || pzheng[cur].letter == 0) {cur--;}}}if(pzheng[0].letter == 0 || cur < 0) {over = true;}}}over = false;size = pfu.size();if(size > 0) {cur = size - 1;while(!over) {if(pfu[cur].letter > k) {ll time = pfu[cur].letter / k;ans += time * pfu[cur].pos * 2;pfu[cur].letter -= time * k;if(pfu[cur].letter == 0)    cur--;} else {ll send = k;ans += 2 * pfu[cur].pos;while(send > 0 && cur >= 0) {ll last = pfu[cur].letter;pfu[cur].letter = max((ll)0,pfu[cur].letter - send);send -= (last - pfu[cur].letter);if(send > 0 || pfu[cur].letter == 0) {cur--;}}}if(pfu[0].letter == 0 || cur < 0) {over = true;}}}printf("%lld\n",ans);return 0;
}

#include <bits/stdc++.h>
#define EPS 1.0e-9
#define PI acos(-1.0)
#define INF 30000000
#define MOD 1000000007
#define mem(a,b) memset((a),b,sizeof(a))
#define TS printf("!!!\n")
#define pb push_back
#define pai pair<int,int>
//using ll = long long;
//using ull= unsigned long long;
//std::ios::sync_with_stdio(false);
using namespace std;
//priority_queue<int,vector<int>,greater<int>> que;
typedef pair<int, int> pairint;
typedef long long ll;
typedef unsigned long long ull;
const int maxn = 200005;
int n,m;
ll aaa[maxn][20];
ll a[maxn];
void init()
{for(int i=1;(1<<i)<=n;i++)for(int j=1;j<=n-(1<<i)+1;j++){aaa[j][i]=min(aaa[j][i-1],aaa[j+(1<<(i-1))][i-1]);}
}
ll runit(int l,int r)
{int now;for(now=0;(1<<now)<=r-l+1;now++);now--;ll ans=min(aaa[l][now],aaa[r-(1<<now)+1][now]);return ans;
}
int cal(ll value,int x,int y)
{if(x>y)return 0;if(value>a[x])return x;if(x==y)return 0;if(value<runit(x,y))return 0;int l=x,r=y,mid;while(r-l>1){mid=(l+r)/2;if(value>=runit(x,mid))r=mid;elsel=mid;}return r;
}
ll work(ll pop,int pop1,int pop2)
{int flag=1;while(flag){pop%=a[pop1];int now=cal(pop,pop1+1,pop2);if(!now)return pop;elsepop1=now;}
}
int main()
{cin >> n >> m;for(int i=1;i<=n;i++){scanf("%I64d",&a[i]);aaa[i][0]=a[i];}init();while(m--){ll cur,l,r;scanf("%I64d %I64d %I64d",&cur,&l,&r);//cin >> cur >> l >> r//cout<<cur<<" "<<l<<" "<<r<<endl;printf("%I64d\n",work(cur,l,r));}return 0;
}