2015暑假训练赛团体赛（8.3）

   
ID
Origin
Title 		 
  12 / 37 Problem A UVALive 4763 Sudoku Extension  
23 / 80 Problem B UVALive 4764 Bing it  
    Problem C UVALive 4765 String of Candied Haws  
  4 / 19 Problem D UVALive 4766 Gold Mines  
    Problem E UVALive 4767 Machine Translation II  
    Problem F UVALive 4768 Mission Impossible  
  2 / 46 Problem G UVALive 4769 Fuzzy Google Suggest  
    Problem H UVALive 4770 Offset Recovery  
  2 / 6 Problem I UVALive 4771 The Number of Sequence Pair  
5 / 26 Problem J UVALive 4772 FM 简单费用流
58 / 93 Problem K UVALive 4773 YY and YY Again 水题
时间： 2024-11-01 08:19:04

2015暑假训练赛团体赛（8.3）的相关文章

哈理工2015暑假训练赛BNU16488 Easy Task（简单题）

A - Easy Task Time Limit:2000MS    Memory Limit:65536KB    64bit IO Format:%lld & %llu SubmitStatusPracticeZOJ 2969 Description Calculating the derivation of a polynomial is an easy task. Given a function f(x) , we use (f(x))' to denote its derivatio

哈理工2015 暑假训练赛 zoj 2976 Light Bulbs

Light BulbsTime Limit:2000MS    Memory Limit:65536KB    64bit IO Format:%lld & %llu SubmitStatusPracticeZOJ 2976 Description Wildleopard had fallen in love with his girlfriend for 20 years. He wanted to end the long match for their love and get marri

哈理工2015暑假训练赛 zoj 2078Phone Cell

Phone CellTime Limit:10000MS    Memory Limit:32768KB    64bit IO Format:%lld & %llu SubmitStatusPracticeZOJ 2978 Description Nowadays, everyone has a cellphone, or even two or three. You probably know where their name comes from. Do you. Cellphones c

2015暑假训练赛个人赛（8.5）

  ID Origin Title   96 / 114 Problem A UVALive 4167 Parity  水题1 60 / 124 Problem B UVALive 4168 Lampyridae Teleportae  水题3 3 / 11 Problem C UVALive 4169 Hex Tile Equations   17 / 41 Problem D UVALive 4170 The Bridges of San Mochti   16 / 36 Problem E

2015暑假训练赛个人赛（8.19）

    ID Origin Title 二分+dp 22 / 89 Problem A UVALive 5983 MAGRID 枚举 19 / 44 Problem B UVALive 5984 Save the Students! ? 1 / 1 Problem C UVALive 5985 Robbing Gringotts ? 38 / 117 Problem D UVALive 5986 Wizarding Duel 预处理前2000个数 65 / 127 Problem E UVALi

2015暑假训练赛个人赛（7.31）

    ID Origin Title 59 / 211 Problem A UVALive 6318 The New President 71 / 156 Problem B UVALive 6319 No Name   38 / 127 Problem C UVALive 6320 Encrypted Password 87 / 127 Problem D UVALive 6321 Kids Love Candies 1 / 20 Problem E UVALive 6322 The Swa

2015暑假训练赛个人赛（7.29）

45 / 368 Problem A URAL 1941 Scary Martian Word   9 / 93 Problem B URAL 1942 Attack at the Orbit   1 / 27 Problem C URAL 1943 Space Rummy 72 / 254 Problem D URAL 1944 Record of the Attack at the Orbit   0 / 2 Problem E URAL 1945 Many-armed Brothers  

比赛-暑假训练赛1 (26 Jul, 2018)

A. 密码 没有想到题解里机智的 P2-P1 避免重复计算,我以为是一个类似最长公共子串的 DP,OrzOrzOrz. 设输入分别为 A, B 两个字符串.f[i][j] 表示 A 串前 i 位与 B 串前 j 位匹配( B 串中字母可以依次在 A 中找到)的方案数. 当 A[i] == B[j], f[i][j] = f[i-1][j-1] 当 A[i] != B[j], f[i][j] = f[i-1][j] . 显然 f[i][0] = i .然后直接这样写会爆空间,注意到 i 这维可以滚

HDU 5371 （2015多校联合训练赛第七场1003）Hotaru's problem(manacher+二分/枚举)

HDU 5371 题意: 定义一个序列为N序列:这个序列按分作三部分,第一部分与第三部分相同,第一部分与第二部分对称. 现在给你一个长为n(n<10^5)的序列,求出该序列中N序列的最大长度. 思路: 来自官方题解:修正了一些题解错别字(误 先用求回文串的Manacher算法,求出以第i个点为中心的回文串长度,记录到数组p中 要满足题目所要求的内容,需要使得两个相邻的回文串,共享中间的一部分,也就是说,左边的回文串长度的一半,要大于等于共享部分的长度,右边回文串也是一样. 因为我们已经记录下来以