【NOIP2010】【Luogu1540】机器翻译
problemsolutioncodes//STL大法好#include#include#includeusingnamespacestd;queueq;sets;intmain(){intm,n,ans=0;cin>>…
problemsolutioncodes//STL大法好#include#include#includeusingnamespacestd;queueq;sets;intmain(){intm,n,ans=0;cin>>…
problemsolutioncodes//(如果你玩数独会怎么填呢)......启发式:把能确定的填上#includeusingnamespacestd;constintscore[10][10]={{0,0,0,0,…
problemsolutioncodes#include#include#includeusingnamespacestd;mapma,mm;stringans;intmain(){boolflag=true;strin…
problem在一个矩阵内找出两条从(1,1)到(m,n)的路径(一条从1,1到m,n一条从m,n到1,1),并且路径之上的权值之和最大。solution状态:f[i][j][k][l],当一张纸条传到i,j另一张传到k…
problemsolutioncodes//每行独立区间DP,贪心反例->某行像这样,41111123333//2^80数据,所以记得高精.#include#include#include#include#include…
problem给定n颗环形串起来的珍珠,每个珍珠有头标记hi和尾标记ti,按照任意顺序合并相邻珍珠u,v,会带来hu∗tu∗tv的收益,并且会结合成新的珍珠w,其中hw=hu,tw=tv。保证相邻珍珠同侧标记相同。求最大…
problemsolutioncodes#includeusingnamespacestd;inth[110],f[110],f2[110],ans;intmain(){intn;cin>>n;for(inti=1;i>…
problemtan90solutiontan90codes#includeusingnamespacestd;intmain(){intflag=0,t=0,res=0;for(inti=0;i>x;t+=300-x;…
problem占坑待填solution占坑待填???codes//交前%一下,送你80分#include#includeusingnamespacestd;constintmaxn=30000010;#definemod…
problem有n堆果子每次可以将两堆果子合并,代价为新堆的果子数。求把所有果子合并成一堆的最小代价。solution每次合并最小的两堆用堆或者两个队列维护证明?反证法。codes#include#includeusin…