[杂题撕烤] - cool's Blog

[杂题撕烤]

cool posted @ 2016年12月09日 20:21 in 撕烤 with tags 杂题 撕烤 , 4048 阅读

T1:给一个长度为n的01串,你需要用K个操作使其全部变成0,每次操作可以对一个区间取反,求方案数(操作顺序不影响方案的不同,不能出现重复操作)。 k,n<=1000

T2:在K维空间中有n个点(xi1,xi2,……,xik),求曼哈顿距离最远的两个点。 K<=8,N<=50000

T3:给出一个长度为n的序列和m个区间[Li,Ri],分别求这m个区间的最长的无重复数字的子串。N<=200000

T4:给出一个长度为n的序列,问从中选出m个数相乘的第K大。N,K<=10000 m<=13(显然序列里的数有正有负)

T5:一个长度为n的序列,可以在这n个数之间的n-1个位置插入+或*,求所有2^(n-1)的方案的和,而且还可以修改某个数。(n<=500000)

T6:一个无向图,将这个图划分为两个点集,使得两个点集的边权和的差最小。(n<=5000 边权和<=400000)

T7:有n块石头,每块有两个值a[i],b[i],a[i]表示搬走这块石头所需花费,b[i]表示同时搬走第i和第i-1块石头所需花费,每次询问搬走[l,r]的石头最小花费,并且还有对某块石头的修改操作。(n<=100000)

 

UK Board Model Paper 说:
2022年8月16日 17:31

Uttarakhand Board Model Paper 2023 Class 2 Pdf Download with Answers for English Medium, Hindi Medium, Urdu Medium & Students for Small Answers, Long Answer, UK Board Model Paper Class 2 Very Long Answer Questions, and Essay Type Questions to Term1 & Term2 Exams Uttarakhand Board Model Paper 2023 Class 2 Pdf Download with Answers for English Medium, Hindi Medium, Urdu Medium & Students for Small Answers, Long Answer, Very Long Answer Questions, and Essay Type Questions to Term1 & Term2 Exams


登录 *


loading captcha image...
(输入验证码)
or Ctrl+Enter
Host by is-Programmer.com | Power by Chito 1.3.3 beta | © 2007 LinuxGem | Design by Matthew "Agent Spork" McGee