html引入了一个design.css文件后加载特别慢

5个回答

4 年多之前 回复

4 年多之前 回复

gzip压缩，提高网页速度

A Famous King’s Trip 旅行的问题
Computational Geometry? 几何的计算
Problem Description Computational geometry is a branch of computer science devoted to the study of algorithms which can be stated in terms of geometry. It often comes up with charming shapes and ideas. In this problem, our poor princess is trapped in a castle by some bad guys again, yeah, again. So, let's seize the chance to be a hero. Right now, the beautiful princess is in the original point of a Cartesian coordinate system, for simplification, the castle is treated as a coordinate system, like a common computational geometry problem. There is a bomb which can be exploded anytime, and it locates at (Xo, Yo) in the castle. To save the princess, we need design a route for her to leave away the bomb as far as possible. But she already has a plan written on her notebook, which contains some vectors, and she insists on escaping in the vectors’ direction one by one, that is, if she is in point(0, 0), and the vector is (X, Y), she will be in point(X, Y) if she escapes in this vector. You get her notebook now, and find princess's plan is a not a good plan sometimes. Then you decide to help the princess to make some slight modification, you can change the order of those vectors, and/or reverse some vectors, that is, change vector (X, Y) to vector (-X, -Y). We want to know the maximum distance to the bomb after modification. Input The first line contains a single integer T, indicating the number of test cases. Each test case begins with three integers N, Xo, Yo. Then N lines following, each line contains two integers, Xi and Yi, indicating a vector. Technical Specification 1. 1 <= T <= 100 2. 1 <= N <= 100 3. -100 <= Xi, Yi <= 100 4. -10 000 <= Xo, Yo <= 10 000 Output For each test case, output the case number first, then the distance rounded to three fractional digits. Sample Input 3 1 1 1 1 1 2 2 3 -1 2 1 -2 3 3 0 2 3 3 2 1 -1 Sample Output Case 1: 2.828 Case 2: 7.000 Case 3: 9.849

C# Visio开发鱼骨图 没有注册类 异常来自 HRESULT:0x80040154
private AxVisioViewer.AxViewer axViewer1; 这行代码音用了.AxViewer控件加载不出来 我在程序中引用的有AxInterop.AxVisioViewer 我觉得问题应该是在COM组件中没有注册 可是工具箱添加COM组件中只有Drawing Control 没有AxVisioViewer 用Resvger32命令注册AxInterop.AxVisioViewer.dll 也报错 说请确保为有效的dll文件 目标平台是X86的、、、 private AxCELL50Lib.AxCell axCell1; 同样引入的这个空间就好使 引入部分和工具箱添加部分的com组件都有这个 错误的堆栈信息 在 System.Windows.Forms.UnsafeNativeMethods.CoCreateInstance(Guid& clsid, Object punkOuter, Int32 context, Guid& iid) 在 System.Windows.Forms.AxHost.CreateInstanceCore(Guid clsid) 在 System.Windows.Forms.AxHost.CreateInstance() 在 System.Windows.Forms.AxHost.GetOcxCreate() 在 System.Windows.Forms.AxHost.set_Site(ISite value) 在 System.ComponentModel.Container.Add(IComponent component, String name) 在 System.ComponentModel.Design.DesignerHost.PerformAdd(IComponent component, String name) 在 System.ComponentModel.Design.DesignerHost.System.ComponentModel.Design.IDesignerHost.CreateComponent(Type componentType, String name) 在 System.ComponentModel.Design.Serialization.DesignerSerializationManager.CreateInstance(Type type, ICollection arguments, String name, Boolean addToContainer) 在 System.ComponentModel.Design.Serialization.DesignerSerializationManager.System.ComponentModel.Design.Serialization.IDesignerSerializationManager.CreateInstance(Type type, ICollection arguments, String name, Boolean addToContainer) 在 System.ComponentModel.Design.Serialization.CodeDomSerializerBase.DeserializeInstance(IDesignerSerializationManager manager, Type type, Object[] parameters, String name, Boolean addToContainer) 在 System.ComponentModel.Design.Serialization.ComponentCodeDomSerializer.DeserializeInstance(IDesignerSerializationManager manager, Type type, Object[] parameters, String name, Boolean addToContainer) 在 System.ComponentModel.Design.Serialization.CodeDomSerializerBase.DeserializeExpression(IDesignerSerializationManager manager, String name, CodeExpression expression) 在 System.ComponentModel.Design.Serialization.CodeDomSerializer.DeserializeStatementToInstance(IDesignerSerializationManager manager, CodeStatement statement) 在 System.ComponentModel.Design.Serialization.CodeDomSerializer.Deserialize(IDesignerSerializationManager manager, Object codeObject) 在 System.Windows.Forms.Design.ControlCodeDomSerializer.Deserialize(IDesignerSerializationManager manager, Object codeObject) 在 System.ComponentModel.Design.Serialization.TypeCodeDomSerializer.DeserializeName(IDesignerSerializationManager manager, String name, CodeStatementCollection statements)
Design T-Shirt
Problem Description Soon after he decided to design a T-shirt for our Algorithm Board on Free-City BBS, XKA found that he was trapped by all kinds of suggestions from everyone on the board. It is indeed a mission-impossible to have everybody perfectly satisfied. So he took a poll to collect people's opinions. Here are what he obtained: N people voted for M design elements (such as the ACM-ICPC logo, big names in computer science, well-known graphs, etc.). Everyone assigned each element a number of satisfaction. However, XKA can only put K (<=M) elements into his design. He needs you to pick for him the K elements such that the total number of satisfaction is maximized. Input The input consists of multiple test cases. For each case, the first line contains three positive integers N, M and K where N is the number of people, M is the number of design elements, and K is the number of elements XKA will put into his design. Then N lines follow, each contains M numbers. The j-th number in the i-th line represents the i-th person's satisfaction on the j-th element. Output For each test case, print in one line the indices of the K elements you would suggest XKA to take into consideration so that the total number of satisfaction is maximized. If there are more than one solutions, you must output the one with minimal indices. The indices start from 1 and must be printed in non-increasing order. There must be exactly one space between two adjacent indices, and no extra space at the end of the line. Sample Input 3 6 4 2 2.5 5 1 3 4 5 1 3.5 2 2 2 1 1 1 1 1 10 3 3 2 1 2 3 2 3 1 3 1 2 Sample Output 6 5 3 1 2 1

Graph Generation 图的生成
Problem Description You are design a graphics generator to create a graph called "GStar". GStar is defined by recursive, the first level "GStar", the GStar(1), is a square like the graph below: +-+ |.| +-+ Then we divide every edge of the GStar(1) into three part, and draw a new square outward on the middle part. Thus we get the GStar(2), like the graph below: ....+-+.... ....|.|.... ..+-+.+-+.. ..|.....|.. +-+.....+-+ |.........| +-+.....+-+ ..|.....|.. ..+-+.+-+.. ....|.|.... ....+-+.... We can get GStar(n) from GStar(n-1) by split the outer bound of every edge on GStar(n-1) into three part and draw a square outward taking place the middle part. The following graph is the GStar(3), pay attention that outer bound touches itself but the inner part are also "outer bound", so the edges are used in generation on the next level of GStar. ................+-+................ ................|.|................ ..............+-+.+-+.............. ..............|.....|.............. ............+-+.....+-+............ ............|.........|............ ..........+-+-+.....+-+-+.......... ..........|.|.|.....|.|.|.......... ........+-+.+-+.....+-+.+-+........ ........|.................|........ ......+-+.................+-+...... ......|.....................|...... ....+-+-+.................+-+-+.... ....|.|.|.................|.|.|.... ..+-+.+-+.................+-+.+-+.. ..|.............................|.. +-+.............................+-+ |.................................| +-+.............................+-+ ..|.............................|.. ..+-+.+-+.................+-+.+-+.. ....|.|.|.................|.|.|.... ....+-+-+.................+-+-+.... ......|.....................|...... ......+-+.................+-+...... ........|.................|........ ........+-+.+-+.....+-+.+-+........ ..........|.|.|.....|.|.|.......... ..........+-+-+.....+-+-+.......... ............|.........|............ ............+-+.....+-+............ ..............|.....|.............. ..............+-+.+-+.............. ................|.|................ ................+-+................ Input The input contains several test cases, the first line of test case contains an integer denoting the number of test cases. For each test cases, there are only three integers K, X, Y. Where K denoting the level of GStar. And you are to output a part of the graph from (X,Y) to (X+9,Y+9), a 10*10 matrix. Where the top-left corner is define as (0,0) and the Y-th character of X-th line is define as (X-1,Y-1). Notice that the empty cell are filled with ".". (1 <= K <= 10, 0 <= X, Y <= 30000) Output For each test cases, output the character matrix. See example for further details. Sample Input 3 1 1 1 2 1 1 5 88 72 Sample Output Case 1: .|........ -+........ .......... .......... .......... .......... .......... .......... .......... .......... Case 2: ...|.|.... .+-+.+-+.. .|.....|.. -+.....+-+ .........| -+.....+-+ .|.....|.. .+-+.+-+.. ...|.|.... ...+-+.... Case 3: +-+....... |......... +-+....... |.|....... +-+-+.+-+. ..|.|.|.|. ..+-+-+-+. ....|.|... ..+-+-+-+. ..|.|.|.|.
C#委託事件如何更新UI的值

Design T-Shirt 具体是怎么做的
Problem Description Soon after he decided to design a T-shirt for our Algorithm Board on Free-City BBS, XKA found that he was trapped by all kinds of suggestions from everyone on the board. It is indeed a mission-impossible to have everybody perfectly satisfied. So he took a poll to collect people's opinions. Here are what he obtained: N people voted for M design elements (such as the ACM-ICPC logo, big names in computer science, well-known graphs, etc.). Everyone assigned each element a number of satisfaction. However, XKA can only put K (<=M) elements into his design. He needs you to pick for him the K elements such that the total number of satisfaction is maximized. Input The input consists of multiple test cases. For each case, the first line contains three positive integers N, M and K where N is the number of people, M is the number of design elements, and K is the number of elements XKA will put into his design. Then N lines follow, each contains M numbers. The j-th number in the i-th line represents the i-th person's satisfaction on the j-th element. Output For each test case, print in one line the indices of the K elements you would suggest XKA to take into consideration so that the total number of satisfaction is maximized. If there are more than one solutions, you must output the one with minimal indices. The indices start from 1 and must be printed in non-increasing order. There must be exactly one space between two adjacent indices, and no extra space at the end of the line. Sample Input 3 6 4 2 2.5 5 1 3 4 5 1 3.5 2 2 2 1 1 1 1 1 10 3 3 2 1 2 3 2 3 1 3 1 2 Sample Output 6 5 3 1 2 1

android开发eclipse导入design，运行时出错无法加载布局
xml代码如下 ``` <RelativeLayout xmlns:android="http://schemas.android.com/apk/res/android" android:layout_width="match_parent" android:layout_height="match_parent" > <android.support.design.widget.TabLayout android:id="@+id/tablayout" android:layout_width="match_parent" android:layout_height="wrap_content" /> </RelativeLayout> ``` 当运行时，就会报错 Caused by: android.view.InflateException: Binary XML file line #7: Error inflating class android.support.design.widget.TabLayout design包导入正确，java代码中也能使用，将design作为依赖项目也试过，都是着这样，请问各位大侠这是怎么回事~~~~(>_<)~~~~
Android Studio中，layout文件下文件打开后没有design界面（已有方法无法解决）

eclipse下导入android.support.design包后clean的时候报错？

F1 Circuit Design 一个程序实现的问题
Description We all know that there is an exciting F1 circuit in Shanghai, but how many of you know how to design an F1 circuit? Designing an F1 circuit is a very complex task. For example, you should know how much time the best F1 driver will take to finish a lap. In this task, we will ask you to solve this problem. An F1 circuit consists of straight raceways, turns and a starting point. We use '-' (with ASCII number 45) or '|' (with ASCII number 124) to describe a section of straight raceways, and use '+' (with ASCII number 43) to describe a turn. If two straight raceways connect to a turn, we call the turn a simple turn, and the speed of an F1 race car entering and leaving a simple turn should not exceed 45 m/s. If two turns are connected with each other, this is a composite turn, and the speed of an F1 racing car entering and leaving a composite turn should not exceed 20 m/s. A simple turn is in one of the four formats shown in Figure 1: Figure 1 Formats of simple turns A composite turn is in one of the eight formats shown in Figure 2: Figure 2 Formats of composite turns You may assume that in an F1 circuit there are only the two types of turns we mentioned above. The starting point of an F1 circuit is the beginning and ending position of an F1 race car. A starting point is in one of the four formats shown in Figure 3, meaning that the start direction is going up ('^' with ASCII number 94), down ('v' with ASCII number 118), left ('<' with ASCII number 60) or right ('>' with ASCII number 62) respectively: Figure 3 Formats of starting point The straight raceways, turns and a starting point mentioned above will compose a closed F1 circuit. We know that a section of straight raceway is M meters long, which indicates that a '-' or '|' equals to M meters. To make the problem easier, we ignore the length of turns and the start point. The F1 race car enters and leaves a turn with the same speed. An F1 driver will run 3 laps in each circuit. On the first lap, the initial speed of the car leaving the starting point should be zero. There is no restriction for the second lap. On the last lap, the speed of the car arriving at the start point should also be zero. We record the running time of the second lap as the best lap time. What you need to do is to calculate the minimum best lap time. What you may also know is that the acceleration of an F1 car doesn't exceed 10 m/s2, and the deceleration doesn't exceed 30 m/s2. Input There are several test cases. The first line of each test case contains an integer M (1 <= M <= 200), which is the length of a section of straight raceways. The next several lines will contain a map of an F1 circuit. A circuit map only contains the circuit, some white spaces and some blank lines. The description will occupy 50 lines or less, and the number of characters in each line will not exceed 100. A test case with M = 0 ends the input, and should not be processed. Output For each test case, output a line containing the best loop time in seconds. You should round the result to two digits after the decimal point. Sample Input 199 +-------------+ +----+ | +----+++ ^ | || | | || | +-----++------+ 0 Sample Output 97.34
Card Collection 怎么实现这个代码
Problem Description In Card Captor Sakura, Sakura is a lovely girl. One day, she opens a magic box containing many cards. Every card has a respective natural force in the real world, such as wind, water, YY, LMY, and so on. Suddenly a gust of wind blows away these cards. Sakura only has a card called “THE_WINDY” in her hand. Sakura knows if any card is not found, disaster comes. So she must collect all the cards. Cards can only be collected one by one. Suppose there are N cards to be collected. It takes Ti to collect the ith card, 1≤i≤N. For the ith card, there is a corresponding card Pi. If card Pi has been collected, it only takes time ti to collect the ith card, where ti<Ti. Your task is to help Sakura design a schedule that takes the shortest time to collect all cards. Input The input consists of several test cases. Each test case starts with a line giving the number N of cards (1≤N≤100). Each of the next N lines describes a card. Every card has the format: Name1 Ti Name2 ti, where Name1 and Name2 are cards’ names, consisting of uppercase letters and underlines. The length of cards’ names is no more than 20 characters. Card Name1 is a card to be collected. It takes Ti to collect Card Name1 without Card Name2. And it takes ti to collect Card Name1 with Card Name2, where ti<Ti. End of input is indicated by a line consisting of a single 0. Output For each test case, output a single line. Each line should give a single integer: the shortest time. Sample Input 5 THE_FLY 67 THE_WINDY 39 THE_SHADOW 97 THE_WINDY 49 THE_WATER 139 THE_FLY 69 THE_RAIN 37 THE_WATER 18 THE_WOOD 5 THE_RAIN 1 1 THE_LOOP 35 THE_LOOP 25 0 Sample Output 176 35

Java学习的正确打开方式

linux系列之常用运维命令整理笔录

Python十大装B语法
Python 是一种代表简单思想的语言，其语法相对简单，很容易上手。不过，如果就此小视 Python 语法的精妙和深邃，那就大错特错了。本文精心筛选了最能展现 Python 语法之精妙的十个知识点，并附上详细的实例代码。如能在实战中融会贯通、灵活使用，必将使代码更为精炼、高效，同时也会极大提升代码B格，使之看上去更老练，读起来更优雅。

2019年11月中国大陆编程语言排行榜
2019年11月2日，我统计了某招聘网站，获得有效程序员招聘数据9万条。针对招聘信息，提取编程语言关键字，并统计如下： 编程语言比例 rank pl_ percentage 1 java 33.62% 2 cpp 16.42% 3 c_sharp 12.82% 4 javascript 12.31% 5 python 7.93% 6 go 7.25% 7 p...

JDK12 Collectors.teeing 你真的需要了解一下

SQL-小白最佳入门sql查询一

【图解经典算法题】如何用一行代码解决约瑟夫环问题

“狗屁不通文章生成器”登顶GitHub热榜，分分钟写出万字形式主义大作

GitHub标星近1万：只需5秒音源，这个网络就能实时“克隆”你的声音

《程序人生》系列-这个程序员只用了20行代码就拿了冠军

11月8日，由中国信息通信研究院、中国通信标准化协会、中国互联网协会、可信区块链推进计划联合主办，科技行者协办的2019可信区块链峰会将在北京悠唐皇冠假日酒店开幕。 　　区块链技术被认为是继蒸汽机、电力、互联网之后，下一代颠覆性的核心技术。如果说蒸汽机释放了人类的生产力，电力解决了人类基本的生活需求，互联网彻底改变了信息传递的方式，区块链作为构造信任的技术有重要的价值。 　　1...

【技巧总结】位运算装逼指南

【管理系统课程设计】美少女手把手教你后台管理
【文章后台管理系统】URL设计与建模分析+项目源码+运行界面 栏目管理、文章列表、用户管理、角色管理、权限管理模块（文章最后附有源码） 1. 这是一个什么系统? 1.1 学习后台管理系统的原因 随着时代的变迁，现如今各大云服务平台横空出世，市面上有许多如学生信息系统、图书阅读系统、停车场管理系统等的管理系统，而本人家里就有人在用烟草销售系统，直接在网上完成挑选、购买与提交收货点，方便又快捷。 试想，若没有烟草销售系统，本人家人想要购买烟草，还要独自前往药...
4G EPS 第四代移动通信系统