随笔分类 -  OTHER OJ

上一页 1 2
lightoj 1025 区间dp
摘要：#include using namespace std; typedef long long ll; char a[70]; ll dp[70][70]; int main(){ int T; scanf("%d",&T); int n; int ca = 0; while(T--){ memset(dp,0,sizeof(dp)); scanf("%s",a+1); ... 阅读全文
posted @ 2016-08-13 16:43 basasuya 阅读(175) 评论(0) 推荐(0)
模拟比赛 树套环问题
摘要：Problem I Font: Times New Roman | Verdana | Georgia Font Size: ← → Problem Description A group is made of n people who are numbered from 0 to n−1. Now 阅读全文
posted @ 2016-07-17 13:41 basasuya 阅读(243) 评论(0) 推荐(0)
浙大 4月月赛
摘要：zoj3929 zoj3930 zoj3931 zoj3933 阅读全文
posted @ 2016-04-12 16:35 basasuya 阅读(171) 评论(0) 推荐(0)
一道bfs与邻接表应用题
摘要：Problem Description 终于有一天，王元姬用他的劫打上了最强王者。他号称，他从来不会在偶数段位停留，因为他的实力太强会跳段（这个13我给满分）。傲娇棠和翔妹觉得他的13装的都比勇哥哥好了，所以要打击他一下，就拿他最擅长的劫来出了一道题。 假设在瓦洛兰大路上有劫的影子一共n个，影子与影 阅读全文
posted @ 2015-09-09 09:55 basasuya 阅读(237) 评论(0) 推荐(0)
欧拉四面体体积应用
摘要：这种应用一种公式，注意如果共面体积是负数，要特判 Problem Description 已知一个三角形ABC三点在空间内的坐标，和空间某一点q到ABC三点的距离，求q点到ABC的距离。 保证存在点q和ABC不共线。 Input 第一行是样例个数。 每一个样例前三行是ABC坐标。 最后一行是q到平面 阅读全文
posted @ 2015-09-08 11:21 basasuya 阅读(226) 评论(0) 推荐(0)
TOJ 4120 Zombies VS Plants
摘要：tmeteorj recently is interested in a game Plants VS Zombies like following picture. And his brain hole is opened so he want to you to solve this probl 阅读全文
posted @ 2015-07-25 09:50 basasuya 阅读(177) 评论(0) 推荐(0)
优先队列运用 TOJ 4123 Job Scheduling
摘要：Given N jobs, each denoted by a 2-tuples integer (pi, ri) where pi is the processing time and ri is the release time. You must construct a schedule fo 阅读全文
posted @ 2015-07-20 16:23 basasuya 阅读(215) 评论(0) 推荐(0)
最小生成树 TOJ 4117 Happy tree friends
摘要：yuebai has an undirected complete graph with n vertices. He wants to know the minimum spanning tree of the graph. It's so easy, so yuebai wants to cha 阅读全文
posted @ 2015-07-07 20:09 basasuya 阅读(193) 评论(0) 推荐(0)

上一页 1 2