danger

1、先引入JSTL库 <%@ taglib uri="http://java.sun.com/jsp/jstl/core" prefix="c"%> 2、循环遍历集合 <c:forEach items="${list}" var="danger"> <div> <div> ${danger.content} </div> <ul> <c:forTokens items="${danger.imagesPath}" delims="," var="file"> <li> <img src="${path}/${file}"> </li> </c:forTokens> </ul> <div><fmt:formatDate value="${danger.createTime}" pattern="yyyy年MM月dd日 HH点mm分ss秒" /></div> </div> </c:forEach> 来源： https://www.cnblogs.com/jiefu/p/10907142.html

P2444 [POI2000]病毒 1 #include <bits/stdc++.h> 2 using namespace std; 3 const int maxn = 35000; 4 5 struct Aho_Corasock_Automaton { 6 struct node { 7 int fail; // 失配指针 8 int son[2]; // 子节点的位置 9 bool danger; // 危险标记 10 }Trie[maxn]; 11 int cnt = 0; // Trie指针 12 void insert(char *s) { 13 int len = strlen(s); 14 int now = 0; // Trie当前指针 15 for (int i = 0; i < len; ++i) { 16 if (Trie[now].son[s[i]-'0'] == 0) { // 如果没有这个子节点 17 Trie[now].son[s[i]-'0'] = ++cnt; // 构造该节点 18 } 19 now = Trie[now].son[s[i]-'0']; 20 } 21 Trie[now].danger = true; 22 } 23 void get_fail() { // 构造fail指针 24 queue<int> que; 25 for

bfs #include <bits/stdc++.h> const int maxn = 100; using namespace std; int n, m, t; bool hasDanger[maxn + 10][maxn + 10]; int danger[maxn + 10][maxn + 10][2]; struct tNode { int r, c; int time; tNode(int rr, int cc, int ttime):r(rr), c(cc), time(ttime){} }; int vis[maxn + 10][maxn + 10][310]; int main() { scanf("%d%d%d", &n, &m, &t); memset(hasDanger, 0, sizeof(hasDanger)); for (int i = 1, r, c, a, b; i <= t; i++) { scanf("%d%d%d%d", &r, &c, &a, &b); hasDanger[r][c] = true; danger[r][c][0] = a; danger[r][c][1] = b; } memset(vis, 0, sizeof(vis)); queue<tNode> q; q.push(tNode(1, 1, 0)); vis[1]