NYOJ737石子合并&NKOJ 圆形操场
NYOJ737石子合并#include#define M 201#define INF 1000000000int n,f[M][M],sum[M][M],stone[M];int main(){ int i,j,k,t; while(~scanf("%d",&n)) { for(i=1;i<=n;i++) scanf("%d",&stone[i]); fo