Ural Steaks Time limit: 0.5 second Memory limit: 64 MB After the personal contest, happy but hungry programmers dropped into the restaurant “Ural Steaks” and ordered n specialty ...
Ural Steaks Time limit: 0.5 second Memory limit: 64 MB After the personal contest, happy but hungry programmers dropped into the restaurant “Ural Steaks” and ordered n specialty ...
题意：给出n个长度为m的字符串(n,m )，然后问选取一个最大的正方形，使得有2个正方形区域的字符串是相同的，求出这个最大正方形的边长即两次出现位置的正方形左上角坐标。 哈希、二维hash、二分、卡大素数 ...
Ural 1029 Ministry 是一道比较简单的贪心题目，以下是一种可行的思路： 首先，我们可以考虑对所有的数字进行排序，然后从小到大依次遍历这些数字。对于每一个数字，我们需要判断它是否可以被当前的部门所处理。...
#include #define MAX_LONG 250001 int N; char S[MAX_LONG * 2]; char T[MAX_LONG]; int next[MAX_LONG]; int main(){ scanf("%d %s %s", &N, S, T); int len = N * 2; int i; for (i = 0;...
2063. Black and White Time limit: 1.0 secondMemory limit: 64 MB Let’s play a game. You are given a row ofnballs, each ball is either black or white. Their positions in a row are numbere...
1075. Thread in a Space Time limit: 1.0 secondMemory limit: 64 MB There are three points in a 3-dimensional space:A,BandC. All the coordinates of the points are integer numbers with a...
2066. Simple Expression Time limit: 1.0 secondMemory limit: 64 MB You probably know that Alex is a very serious mathematician and he likes to solve serious problems. This is another probl...
URAL - 2104 题意：给定一个纸带，长度为n宽为1，正反两面都有n个正方形，每个正方形上有A,B两个字母，轮流进行操作， ALICE先手，操作规则为如果长度为偶数则可以对折，当操作到一种正反面全部为一个字母时...
2065. Different Sums Time limit: 1.0 second Memory limit: 64 MB Alex is a very serious mathematician and he likes to solve serious problems. For example, this problem. ...You are to const
我也没有题目啦 就是说给一个字符串求出字串中式回文的最长的字串。。好乱啦。 给定一个字符串，求最长回文子串。 算法分析： 穷举每一位，然后计算以这个字符为中心的最长回文子串。注意这里要分两种情况，一...
DescriptionLet’s play a game. You are given a row of n balls, each ball is either black or white. Their positions in a row are numbered from 1 to n. You know the total number of balls n, but have no ...
题目链接URAL - 1136 Parliament 题意： 规定：左结点的值<根结点的值<右结点的值 然后给你一个后序遍历的序列，让你按照右节点 > 左节点 > 根节点的顺序输出这个二叉树 思路： 我们首先要建树，但是，...
一个简单的树形dp dp[i][0]表示不选i结点 dp[i][0] = sum(max(dp[son[i]][1],dp[son[i]][0])) dp[i][1]表示选i结点 dp[i][1] = sum(dp[son[i]][0]) #include <iostream>...algorith...
题意： 给定N个环卫，和若干匹配关系。求最大匹配，并输出解。... 2 ural 1099 3 一般图最大匹配：带花树算法（模板） 4 g[][]储存边 5 复杂度：N^3 6 solve(n)，求解，返回匹配数 7 match...
1000. A+B Problem 题意：标准的a+b问题 1001. Reverse root 题意：输入一些long long，数与数之间的空格不固定，要求逆序输出他们的square root。 ...方法：可以用一个stack或者静态数组，先存下输入，再倒序输出...
2066. Simple Expression Time limit: 1.0 second Memory limit: 64 MB You probably know that Alex is a very serious mathematician and he likes to solve serious problems. This is another proble
Hyperjump 具体题目请点击我查看 n=int(input()) A=[] m=0 maxx=0 for i in range(n): A.append(int(input())) for i in range(n): m=m+A[i] if(m<=0): m=0 if(m>maxx): ...print(maxx)
题目：http://acm.timus.ru/problem.aspx?space=1&num=1099题意：给出一个无向图，求无向图的最大匹配思路：模板题#include using namespace std;const int N = 310;struct edge { int to, next;...
1297. Palindrome Time limit: 1.0 second Memory limit: 64 MB The “U.S. Robots” HQ has just received a rather alarming anonymous letter. It states that the agent from the competing «Robots Unlimited...
题目链接：https://vjudge.net/problem/URAL-1627 Description: Businessman Petya recently bought a new house. This house has one floor withn×msquare rooms, placed in rectangular lattice. Some...
题意：给你2*1e5个点，定义最好的朋友是指，u和v的距离大于或等于u,v,w相互三条边的距离之和的一半，w为除了u,v任意一个点，u，v不可重复，让你输出有几对最好的朋友，并输出编号 解析：因为三点如果不共线，另外两...
思路：对于起点要么横着走，要么竖着走，则共有四种方式，直接竖横、横竖、先横后竖再横、现竖后横再竖，对于中间路径取最大值即可。 #include #include #include #include using namespace std;...
题目大意：给你长度为n的字符串（n<=1e6），让你对它进行划分，如果一段里面只有字母和 空格可以包含m（m<=1e5）个，如果有其他字符只能包含n个，问你最少需要分成几段。 思路：划分dp,dp[ i ] 表示以i为...
( http://www.elijahqi.win/2017/12/30/ural-1143-electric-path/) Background At the team competition of the 10th national student informatics Olympic, which is organized at Hanoi National University, t
2025. Line Fighting Time limit: 1.0 second Memory limit: 64 MB Boxing, karate, sambo… The audience is sick of classic combat sports. That is why a popular sports channel launches a...
URAL 1557 题目链接： 题意： 给一个无向图n个点m条边。 问删除两条边的方案，使得图不连通。 思路： 基本照着别人的博客打的。 题目很复杂，建模也很复杂。 首先分析删除边有几种情况。 一．删除边种有一...
原文地址：http://acm.timus.ru/problem.aspx?space=1&num=1033题目Labyrinth的管理层决定用新装壁纸迎接新季节的到来。因此他们需要一个程序计算Labyrinth里面的墙壁的面积，这个工作就交给你的大兄弟！...
1820. Ural Steaks Time limit: 0.5 second Memory limit: 64 MB After the personal contest, happy but hungry programmers dropped into the restaurant “Ural Steaks” and ordered n specialty steak
题目链接：http://acm.timus.ru/problem.aspx?space=1&num=1149 思路： 神奇的模拟 代码： #include #include char a[2]={'+','-'}; void work(int n) { for(int i=1;i;i++) { printf("sin(");... pri
During several decades, scientists from planet Nibiru are working to create an engine that would allow spacecrafts to fall into hyperspace and move there with superluminal velocity....