撒旦
by 包子入侵 @ 2017-07-30 11:15:19
```cpp
#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;
int mod(int a)
{
return ((a%10)+10)%10;
}
int main()
{
int s[51][51][51],l,w[51][51][51],i,j,k,r,m,n,a[101];
scanf("%d%d",&n,&m);
for (i=1;i<=n;i++)
{
scanf("%d",&a[i]);
a[i+n]=a[i];
}
for (int i=1;i<=2*n;i++)
a[i]+=a[i-1];
for (i=1;i<=2*n;i++)
{
for (j=i;j<=2*n;j++)
s[i][j][1]=w[i][j][1]=mod(a[j]-a[i-1]);
}
for (int i=2;i<=m;i++)
for (int l=1;l<=2*n;l++)
for (int r=l+i-1;r<=2*n;r++)
w[l][r][i]=9999;
for (i=2;i<=m;i++)
{
for (j=1;j<=2*n;j++)
{
for (k=i+j-1;k<=2*n;k++)
{
for (r=i+j-2;r<k;r++)
{
s[j][k][i]=max(s[j][k][i],s[j][r][i-1]*mod(a[k]-a[r]));
w[j][k][i]=min(w[j][k][i],w[j][r][i-1]*mod(a[k]-a[r]));
}
}
}
}
r=0;
j=9999;
for (i=1;i<=n;i++)
{
r=max(r,s[i][i+n-1][m]);
j=min(j,w[i][i+n-1][m]);
}
printf("%d\n%d",j,r);
return 0;
}
```
by 包子入侵 @ 2017-07-30 11:55:31
大佬
by LucasLi @ 2017-08-19 20:48:20
满足了吧
by LucasLi @ 2017-08-19 20:48:47
有毒吧@顺其自然顺其
by fly20040720 @ 2017-10-12 19:29:41