题目链接:http://www.lydsy.com/JudgeOnline/problem.php?id=1800
n很小,直接枚举四个点即可,注意可以用环来处理,一圈走下来,最后答案除以4,因为每一组会被重复计算4遍(四个点分别做一次起点)
计算的时候一定要注意边界!
复杂度O(n^4)
贴代码
#include<cstdio>
#include<cstring>
int f[45],a[45];
int n,ans;
using namespace std;
int main(){
// freopen("1800.in","r",stdin);
// freopen("1800.out","w",stdout);
scanf("%d",&n);
f[0]=0;
for (int i=1;i<=n;i++) scanf("%d",&a[i]),a[i+n]=a[i];
for (int i=1;i<=n*2;i++)f[i]=f[i-1]+a[i];
ans=0;
for (int i=1;i<=n;i++)
for (int j=i+1;j<=i+n-1;j++)
for (int k=j+1;k<=i+n-1;k++)
for (int t=k+1;t<=i+n-1;t++)
if ((f[t]-f[k]==f[j]-f[i])&&(f[k]-f[j]==f[i+n-1]-f[t]+f[i]-f[i-1])) ans++;
ans/=4;
printf("%d",ans);
return 0;
}
【写的有漏洞的,欢迎路过大神吐槽】
2016/12/29 23:49:53
Ending.