#include<cstdio>
#include<algorithm>
using namespace std;
inline int read()
{int x;char c;while((c=getchar())<'0'||c>'9');for(x=c-'0';(c=getchar())>='0'&&c<='9';)x=(x<<3)+(x<<1)+c-'0';return x;
}
#define MN 40000
#define K 200
struct query{int p,x,y,i,f;}p[MN*2+5];
bool cmp(query a,query b){return a.p==b.p?a.f<b.f:a.p<b.p;}
int a[MN+5],ans[MN+5],f[K+5][K+5],ff[MN+5];
int cal(int x,int y)
{if(x<=K)return f[x][y];int i,r=0;for(i=y;i<=MN;i+=x)r+=ff[i];return r;
}
int main()
{freopen("datastructure.in","r",stdin);freopen("datastructure.out","w",stdout);int n,q,i,j,k,l,r,x,y;n=read();q=read();for(i=1;i<=n;++i)a[i]=read();for(i=0;i<q;++i){l=read();r=read();x=read();y=read();p[i<<1]=(query){l,x,y,i,-1};p[i<<1|1]=(query){r,x,y,i,1};}sort(p,p+(q<<1),cmp);for(i=1,j=0;i<=n;++i){for(;p[j].p==i&&p[j].f<0;++j)ans[p[j].i]-=cal(p[j].x,p[j].y);for(k=1;k<=K;++k)++f[k][a[i]%k];++ff[a[i]];for(;p[j].p==i;++j)ans[p[j].i]+=cal(p[j].x,p[j].y);}for(i=0;i<q;++i)printf("%d\n",ans[i]);fclose(stdin);fclose(stdout);return 0;
}

#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
#define ll long long
inline int read()
{int x;char c;while((c=getchar())<'0'||c>'9');for(x=c-'0';(c=getchar())>='0'&&c<='9';)x=(x<<3)+(x<<1)+c-'0';return x;
}
#define MN 5000
#define INF (1LL<<60)
ll f[MN+5][MN+5];
int x[MN+5],w[MN+5],q[MN+5],ql,qr,t[MN+5];
int cal(int k,int n,int x,int y)
{int l=x+1,r=n,mid,res=n+1;while(l<=r){mid=l+r>>1;if(f[k][x]+f[mid][x]>f[k][y]+f[mid][y])l=mid+1;else res=mid,r=mid-1;}return res;
}
int main()
{freopen("easyproblem.in","r",stdin);freopen("easyproblem.out","w",stdout);int n,k,i,j,l;n=read();k=read();if(k>=n)return 0*puts("0");for(i=1;i<=n;++i)x[i]=read(),w[i]=read();for(i=1;i<=n;++i)for(j=i;j--;)f[i][j]=f[i][j+1]+1LL*w[j+1]*(x[i]-x[j+1]);for(i=1;i<=n;++i)f[0][i]=INF;if(n<=300)for(l=1;l<=k;++l)for(i=l;i<=n;++i)for(f[l][i]=INF,j=l-1;j<i;++j)f[l][i]=min(f[l][i],f[l-1][j]+f[i][j]);elsefor(l=1;l<=k;++l)for(ql=0,qr=-1,i=l;i<=n;++i){while(ql<qr&&(t[qr]=cal(l-1,n,i-1,q[qr]))<=t[qr-1])--qr;if(ql==qr)t[qr]=cal(l-1,n,i-1,q[qr]);q[++qr]=i-1;while(ql<qr&&t[ql]<=i)++ql;f[l][i]=f[l-1][q[ql]]+f[i][q[ql]];}cout<<f[k][n];fclose(stdin);fclose(stdout);return 0;
}

#include<cstdio>
#include<cstdlib>
inline int read()
{int x;char c;while((c=getchar())<'0'||c>'9');for(x=c-'0';(c=getchar())>='0'&&c<='9';)x=(x<<3)+(x<<1)+c-'0';return x;
}
#define MN 50
int n,g[MN+5][MN+5],a[MN+5],an,u[MN+5];
int px[MN*MN+5],py[MN*MN+5],cnt;
double ans;
void dfs(int x,int k,int s)
{int i;if(x>n){if((k?(double)s/k:0)>=ans){ans=k?(double)s/k:0;for(an=0,i=1;i<=n;++i)if(u[i])a[++an]=i;}return;}u[x]=0;dfs(x+1,k,s);for(i=1;i<=cnt;++i)if(g[x][px[i]]&&g[x][py[i]])++s;for(i=1;i<x;++i)if(u[i]&&g[x][i])px[++cnt]=i,py[cnt]=x;u[x]=1;dfs(x+1,k+1,s);for(i=1;i<x;++i)if(u[i]&&g[x][i])--cnt;
}
void cal()
{int i,j,s=0,k=0;for(cnt=0,i=1;i<=n;++i)if(u[i]){++k;for(j=1;j<=cnt;++j)if(g[i][px[j]]&&g[i][py[j]])++s;for(j=1;j<i;++j)if(u[j]&&g[i][j])px[++cnt]=i,py[cnt]=j;}if((k?(double)s/k:0)>ans){ans=k?(double)s/k:0;an=0;for(i=1;i<=n;++i)if(u[i])a[++an]=i;}
}
void sb()
{int i,j,k,l;for(i=1;i<=n;++i)u[i]=1;cal();for(i=1;i<=n;++i)u[i]=0,cal(),u[i]=1;for(i=1;i<=1000;++i,cal())for(j=1;j<=n;++j)u[j]=rand()&1;for(i=1;i<=n;++i)for(j=i+1;j<=n;++j)for(k=j+1;k<=n;++k)if(g[i][j]&&g[j][k]&&g[k][i]){for(l=1;l<=n;++l)u[l]=0;u[i]=u[j]=u[k]=1;cal();}for(i=1;i<=n;++i)for(j=i+1;j<=n;++j)for(k=j+1;k<=n;++k)for(l=k+1;l<=n;++l)if(g[i][j]&&g[i][k]&&g[i][l]&&g[j][k]&&g[j][l]&&g[k][l]){for(int p=1;p<=n;++p)u[p]=0;u[i]=u[j]=u[k]=u[l]=1;cal();}
}
int main()
{srand(23333);freopen("triangle.in","r",stdin);freopen("triangle.out","w",stdout);int i,j;n=read();for(i=1;i<=n;++i)for(j=1;j<=n;++j)g[i][j]=read();if(n<=20)dfs(1,0,0);else sb();printf("%d\n",an);for(i=1;i<=an;++i)printf("%d ",a[i]);fclose(stdin);fclose(stdout);return 0;
}

View Code

#include<cstdio>
#include<cmath>
#include<cstring>
inline int read()
{int x;char c;while((c=getchar())<'0'||c>'9');for(x=c-'0';(c=getchar())>='0'&&c<='9';)x=(x<<3)+(x<<1)+c-'0';return x;
}
#define MN 50
#define MV 19650
#define ME 78450
#define S MV+1
#define T MV+2
#define eps 1e-6
#define INF 1e6
struct edge{int nx,t;double w;}e[ME*2+5];
int g[MN+5][MN+5],h[MV+5],en=1,q[MV+5],qn,d[MV+5],c[MV+5];
inline void ins(int x,int y,double w)
{e[++en]=(edge){h[x],y,w};h[x]=en;e[++en]=(edge){h[y],x,0};h[y]=en;
}
bool bfs()
{int i,j;memset(d,0,sizeof(d));for(d[q[i=qn=0]=S]=1;i<=qn;++i)for(j=c[q[i]]=h[q[i]];j;j=e[j].nx)if(e[j].w>eps&&!d[e[j].t])d[q[++qn]=e[j].t]=d[q[i]]+1;return d[T];
}
double dfs(int x,double r)
{if(x==T)return r;double k,u=0;for(int&i=c[x];i;i=e[i].nx)if(e[i].w>eps&&d[e[i].t]==d[x]+1){k=dfs(e[i].t,r-u<e[i].w?r-u:e[i].w);u+=k;e[i].w-=k;e[i^1].w+=k;if(fabs(u-r)<eps)return u;}return d[x]=0,u;
}
void dfs(int x)
{d[x]=1;for(int i=h[x];i;i=e[i].nx)if(!d[e[i].t]&&e[i].w>eps)dfs(e[i].t);
}
int main()
{int n=read(),i,j,k,cnt=n;double l,r,mid,ans;for(i=1;i<=n;++i)ins(S,i,0);for(i=1;i<=n;++i)for(j=1;j<=n;++j)g[i][j]=read();for(i=1;i<=n;++i)for(j=1;j<i;++j)for(k=1;k<j;++k)if(g[i][j]&&g[j][k]&&g[k][i])ins(++cnt,T,1),ins(i,cnt,1),ins(j,cnt,1),ins(k,cnt,1);for(l=0,r=400,k=0;k<=50;++k){mid=(l+r)/2;for(i=h[S];i;i=e[i].nx)e[i].w=mid,e[i^1].w=0;memset(d,0,sizeof(d));for(d[q[i=qn=0]=S]=1;i<=qn;++i)for(j=h[q[i]];j;j=e[j].nx){if(!d[e[j].t])d[q[++qn]=e[j].t]=d[q[i]]+1;if(d[e[j].t]>d[q[i]])e[j].w+=e[j^1].w,e[j^1].w=0;}for(ans=0;bfs();)ans+=dfs(S,INF);for(i=h[T];i;i=e[i].nx)if(e[i].w>eps&&e[i].w<1-eps)break;(i?l:r)=mid;}memset(d,cnt=0,sizeof(d));dfs(S);for(i=1;i<=n;++i)if(!d[i])++cnt;printf("%d\n",cnt);for(i=1;i<=n;++i)if(!d[i])printf("%d ",i);
}