题解列表

筛选

1896: 蓝桥杯算法提高VIP-矩阵乘法

#####个人认为还是先记住那个矩阵连乘的公式比较好,关键就在那个公式取子问题能不能理解*min(dp[i][j],dp[i][k]+dp[k+1][j]+p[i-1]*p[k]*p[j])*```c++#include#includeusingnamespacestd;constintMAXN=10

2799: 奥运奖牌计数(java)

摘要:解题思路:注意事项:参考代码:import java.util.Scanner; public class Main {public static void main(String[] args) {……

1300: 悠闲的漫步

```cpp#includeusingnamespacestd;structNode{intid,l,r;Node(){l=r=0;}}tr[1001];intp,dep[1010],ans=0;voidaddedge(inti,intr,intl){tr[i].id=i;tr[i].l=l;tr[i

1301: 尼克的任务

```cpp#include#includeusingnamespacestd;longn,k,sum[10001],num=1,f[10001];structren{longks,js;};renz[10001];intcmp(rena,renb){returna.ks>b.ks;}intmain(

1302: 棋盘覆盖

```cpp#include#includeintn,m,x[4]={0,0,1,-1},y[4]={-1,1,0,0},link[10201],head[10201],cnt;boolmap[101][101],used[10201];structTT{intv,

1303: 统计数字

```cpp#includeusingnamespacestd;inta[500001],n,ans=1;voidqs(intl,intr){intm=a[(l+r)>>1],i=l,j=r;while(i

1304: 阶乘后K位

```cpp#includeusingnamespacestd;intmain(){longlongpro=1;inti,j,n,k;charstr[128]={'\0'};scanf("%lld%d",&n,&k);for(i=n;i>=1;i--){pro*=i;while(true){if(pr

1305: 老管家的忠诚

```cpp#includeusingnamespacestd;intdivide(int*a,int*b,intlow,inthigh){intmid=a[low],tmp=b[low];while(low=mid&&lown;a=newint[m];b=newint[m];for(inti=0;i