2017年02月_SDUTyangkun

10月 09月 08月 07月 06月 05月 04月 03月 02月 01月

原创 UVALive 6953 Digi Comp II（拓扑）

题意： m个开关，n个球。每个开关有两个状态，左或右，左则滚到左边，右则滚到右边。每滚一个球状态则反转一次。问最后每个开关的状态是怎样的。解题：因为球数实在太多（10^18），一个一个模拟果断不行，而开关的最后状态只取决于滚过的球数和初始状态。所以计算出每个点球的流量并记录节点初始的状态即可。注意：左右可以连同一个点！！！并且一开始不仅仅只有一为

2017-02-23 20:55:18 423

原创（转）三分问题 + UVALive 6954 Euclidean TSP

三分查找我们都知道二分查找适用于单调函数中逼近求解某点的值。如果遇到凸性或凹形函数时，可以用三分查找求那个凸点或凹点。下面的方法应该是三分查找的一个变形。如图所示，已知左右端点L、R，要求找到白点的位置。思路：通过不断缩小 [L,R] 的范围，无限逼近白点。做法：先取 [L,R] 的中点 mid，再取 [mid,R] 的中点 mmid

2017-02-23 10:02:54 679

原创 Finding Lines UVALive 6955(rand随机化过题 )

题意：给 n（10^5）个点，问是否满足超过%p的点在同一条直线上。 #include using namespace std;int x[101000],y[101000];using namespace std;bool judge(int a, int b, int c)//判断三点是否共线{ return (y[b] - y[a]) * (x[c] - x[a]) =

2017-02-23 08:42:08 374

原创 C - Cent Savings UVALive - 6952

注意动态规划的思路就是由各个状态递推到下一个状态规定dp【i】【j】为第i跟数分割为j块#include using namespace std;#define INF 0x3f3f3f3fint dp[2200][22];int sum[2200];int a[2200];int main(){ int n,d; while(~scanf("%d%d",

2017-02-22 16:00:11 505

原创 cf B. Code For 1

B. Code For 1time limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputJon fought bravely to rescue the wildlings wh

2017-02-22 09:04:38 709

There is an infinite beehive like the one given in the figure. We consider two cells to be adjacent if andonly if they share a side. A path of length k from cell c0 to cell ck is a sequence of cells c

2017-02-21 14:23:58 421

原创 C - Magical GCD UVALive - 6582 (STL )

题意：就是找个连续子序列，使得长度乘上这个子序列的gcd的值最大。#include using namespace std;#define ll long longmapv;map::iterator it,itt;ll a[110000];int main(){ int t; scanf("%d", &t); while(t--) {

2017-02-20 21:06:04 335

原创 I - Crane UVALive - 6588

#include using namespace std;int a[11000];struct node{ int s,e;}tmp,ans[21000]; int n;int Find(int x){ for(int i = 1; i <= n; i++) { if(a[i] == x) return i;

2017-02-20 16:59:45 421

原创 Problem on Group Trip UVALive - 7219

#include using namespace std;#define maxn 500struct node{ int s[4];} p[maxn];int room[4];int flag[4];int main(){ int t; scanf("%d",&t); int cas = 1; while(t--) {

2017-02-18 14:49:40 362 2

原创 uva 7529 - DNA Sequencing

#includeusing namespace std;mapma;int num[10000];int len[10000];char s[550][550];char tmp[5500];int k, m, n;int main(){ while(~scanf("%d%d",&n,&k)) { ma.clear(); if(!n

2017-02-17 14:54:13 429

原创 hdu Coconuts 5925（二维离散化+dfs）

CoconutsTime Limit: 9000/4500 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 762 Accepted Submission(s): 223Problem DescriptionTanBig, a friend of

2017-02-17 08:49:54 416

原创 Auxiliary Set hdu5927（dfs）

Auxiliary SetTime Limit: 9000/4500 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1120 Accepted Submission(s): 349Problem DescriptionGiven a roote

2017-02-16 11:11:13 341

原创 Basic Data Structure hdu 5929

Basic Data StructureTime Limit: 7000/3500 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1366 Accepted Submission(s): 338Problem DescriptionMr. Fr

2017-02-15 19:51:47 312

原创 poj 2984Martian Mining(dp)

Martian MiningTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 2611 Accepted: 1624DescriptionThe NASA Space Center, Houston, is less than 200 miles from San Antonio, Texas (the si

2017-02-14 10:30:08 353

原创 Get Many Persimmon Trees poj(动态规划矩形面积一定时所圈中最大的树)

Get Many Persimmon TreesTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 4254 Accepted: 2778DescriptionSeiji Hayashi had been a professor of the Nisshink

2017-02-14 08:47:32 516

原创 Applications zoj 3705

ApplicationsTime Limit: 2 Seconds Memory Limit: 65536 KBRecently, the ACM/ICPC team of Marjar University decided to choose some new members from freshmen to take part in the ACM/ICPC comp

2017-02-13 20:00:47 337

原创 Cheapest Palindrome poj 3280 (区间dp)

Cheapest PalindromeTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 9279 Accepted: 4478DescriptionKeeping track of all the cows can be a tricky task so F

2017-02-10 20:48:07 262

原创 The King’s Ups and Downs hdu 4489 (递推dp）

The King’s Ups and DownsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 562 Accepted Submission(s): 394Problem DescriptionThe

2017-02-10 17:32:35 440

原创 poj 1054The Troublesome Frog

The Troublesome FrogTime Limit: 5000MS Memory Limit: 100000KTotal Submissions: 12103 Accepted: 3646Case Time Limit: 500MSDescriptionIn Korea, the naughtines

2017-02-10 11:01:19 423

原创 poj 1191棋盘分割（递归dp，记忆化搜索）

棋盘分割Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 14692 Accepted: 5248Description将一个８*８的棋盘进行如下分割：将原棋盘割下一块矩形棋盘并使剩下部分也是矩形，再将剩下的部分继续如此分割，这样割了(n-1)次后，连同最后

2017-02-10 09:25:22 366

原创 Attack on Titans（递推dp 条件限制）

Attack on TitansTime Limit: 2 Seconds Memory Limit: 65536 KBOver centuries ago, mankind faced a new enemy, the Titans. The difference of power between mankind and their newfound enemy was

2017-02-09 20:33:37 1082 5

原创 B. Working out （递推dp ）

B. Working outtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputSummer is coming! It's time for Iahub and Ia

2017-02-09 08:27:42 375

原创 poj 3411Paid Roads(走重复点的dfs )

Paid RoadsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7017 Accepted: 2599DescriptionA network of m roads connects N cities (numbered from 1 to N). T

2017-02-08 10:35:21 286

原创迷失の搜索树

迷失の搜索树Time Limit: 1000MS Memory Limit: 65536KBSubmit Statistic DiscussProblem Description小璐在机缘巧合之下获得了一个二叉搜索树，这个二叉搜索树恰好有n个节点，每个节点有一个权值，每个节点的权值都在[1,n]这个区间内，并且两两不相同，真是优美的性质啊但是命运的不公又让她失去

2017-02-07 22:32:37 639

原创二叉排序树

二叉排序树Time Limit: 1000MS Memory Limit: 65536KBSubmit Statistic DiscussProblem Description二叉排序树的定义是：或者是一棵空树，或者是具有下列性质的二叉树：若它的左子树不空，则左子树上所有结点的值均小于它的根结点的值；若它的右子树不空，则右子树上所有结点的值均大于它的根结点的值；

2017-02-07 22:23:25 348

原创树结构练习——排序二叉树的中序遍历

树结构练习——排序二叉树的中序遍历Time Limit: 1000MS Memory Limit: 65536KBSubmit Statistic DiscussProblem Description在树结构中，有一种特殊的二叉树叫做排序二叉树，直观的理解就是——(1).每个节点中包含有一个关键值 (2).任意一个节点的左子树（如果存在的话）的关键值小于该节点的

2017-02-07 21:37:21 295

原创 poj 2892 hdu 1540Tunnel Warfare（poj 线段树区间合并）

Tunnel WarfareTime Limit: 1000MS Memory Limit: 131072KTotal Submissions: 8021 Accepted: 3325DescriptionDuring the War of Resistance Against Japan, tunnel warfare

2017-02-07 20:47:37 348

原创 poj 2352 Stars（线段树）

StarsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 45051 Accepted: 19558DescriptionAstronomers often examine star maps where stars are represented by

2017-02-07 11:01:25 337

原创 poj 1750Potted Flower（线段树区间合并动态规划区间求最大连续和）

Potted FlowerTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 4786 Accepted: 1827DescriptionThe little cat takes over the management of a new park. There

2017-02-07 08:46:15 739

原创 Mayor's posters（线段树成段更新）

Mayor's postersTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 61557 Accepted: 17790DescriptionThe citizens of Bytetown, AB, could not stand that the ca

2017-02-05 19:33:33 405

原创 A Simple Problem with Integers(线段树成段更新)

A Simple Problem with IntegersTime Limit: 5000MS Memory Limit: 131072KTotal Submissions: 102892 Accepted: 32121Case Time Limit: 2000MSDescriptionYou have N

2017-02-04 21:34:44 704

原创 Just a Hook（线段树区间更新）

Just a HookTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 29771 Accepted Submission(s): 14696Problem DescriptionIn the game

2017-02-04 00:16:03 266

原创 Billboard（线段树单点更新）

BillboardTime Limit: 20000/8000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 20627 Accepted Submission(s): 8546Problem DescriptionAt the entranc

2017-02-03 15:23:27 586

原创 Minimum Inversion Number （单点更新线段树）

Minimum Inversion NumberTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 19112 Accepted Submission(s): 11525Problem Description

2017-02-03 11:44:16 1337