07 2020 档案
摘要：C. Uncle Bogdan and Country Happiness #include <iostream> #include <vector> #include <algorithm> #include <string> #include <set> #include <queue> #in
阅读全文
摘要：B. Array Walk #include <iostream> #include <vector> #include <algorithm> #include <string> #include <set> #include <queue> #include <map> #include <ss
阅读全文
摘要：void getnxt(char *s,int *next) { int k=-1; int j=0; pext[j]=-1; while(j<len) { if(k 1 || s[j]==s[k]) { k++; j++; pext[j]=k; } else { k=pext[k]; } } }
阅读全文
摘要：A2. Prefix Flip (Hard Version) #include <iostream> #include <vector> #include <algorithm> #include <string> #include <set> #include <queue> #include <
阅读全文
摘要：k-Tree 对dp数情况的问题还是不太懂 #include <iostream> #include <vector> #include <algorithm> #include <string> #include <set> #include <queue> #include <map> #inc
阅读全文
摘要：Drop Voicing #include <iostream> #include <vector> #include <algorithm> #include <string> #include <set> #include <queue> #include <map> #include <sst
阅读全文
摘要：struct BigInteger { typedef unsigned long long LL; static const int BASE = 100000000; static const int WIDTH = 8; vector<int> s; BigInteger& clean() {
阅读全文
摘要：1196D2 - RGB Substring (hard version) #include <iostream> #include <vector> #include <algorithm> #include <string> #include <set> #include <queue> #in
阅读全文
摘要：C - Power Strings #include <iostream> #include <vector> #include <algorithm> #include <string> #include <set> #include <queue> #include <map> #include
阅读全文
摘要：POJ 3974 #include <iostream> #include <vector> #include <algorithm> #include <string> #include <set> #include <queue> #include <map> #include <sstream
阅读全文
摘要：Keyboard Free #include <bits/stdc++.h> #define ll long long #define ld long double #define pii pair<int, int> #define rep(i,a,b) for(ll i=a;i<=b;i++)
阅读全文
摘要：叉乘，点乘，用结构体存cos^2 int n, ans = 1, X[N], Y[N]; struct node { double x,y; node(): node(0,0){} node(double x,double y):x(x),y(y){} bool operator < (const
阅读全文
摘要：多校赛第二场B题 #include <bits/stdc++.h> #define ll long long #define lll unsigned long long #define pii pair<int, int> #define rep(i,a,b) for(ll i=a;i<=b;i+
阅读全文
摘要：题目描述 有一个a*b的整数组成的矩阵，现请你从中找出一个n*n的正方形区域，使得该区域所有数中的最大值和最小值的差最小。 输入格式 第一行为3个整数，分别表示a,b,n的值 第二行至第a+1行每行为b个非负整数，表示矩阵中相应位置上的数。每行相邻两数之间用一空格分隔。 输出格式 仅一个整数，为a*
阅读全文
摘要：1202B - You Are Given a Decimal String... 这个复杂度看着都觉得有点悬（O(100*N)），居然才用500ms #include <iostream> #include <vector> #include <algorithm> #include <strin
阅读全文
摘要：1204C - Anna, Svyatoslav and Maps 看别人题解才知道题目是怎么回事。。。 #include <iostream> #include <vector> #include <algorithm> #include <string> #include <set> #incl
阅读全文
摘要：1244D - Paint the Tree #include <iostream> #include <vector> #include <algorithm> #include <string> #include <set> #include <queue> #include <map> #in
阅读全文
摘要：1221D - Make The Fence Great Again 写不出状态转移方程有点难受 #include <iostream> #include <vector> #include <algorithm> #include <string> #include <set> #include
阅读全文
摘要：1249E - By Elevator or Stairs? #include <iostream> #include <vector> #include <algorithm> #include <string> #include <set> #include <queue> #include <
阅读全文
摘要：You play a computer game. In this game, you lead a party of mm heroes, and you have to clear a dungeon with nn monsters. Each monster is characterized
阅读全文
摘要：1283E - New Year Parties #include <iostream> #include <vector> #include <algorithm> #include <string> #include <set> #include <queue> #include <map> #
阅读全文
摘要：1286A - Garland 玄学特判+贪心 #include <iostream> #include <vector> #include <algorithm> #include <string> #include <set> #include <queue> #include <map> #i
阅读全文
摘要：1296E1 - String Coloring (easy version) 因为只有两种颜色，只要可以排成两组非递减序列即可 #include <iostream> #include <vector> #include <algorithm> #include <string> #include
阅读全文
摘要：You wrote down all integers from 00 to 10n−110n−1, padding them with leading zeroes so their lengths are exactly nn. For example, if n=3n=3 then you w
阅读全文
摘要：原题 The round carousel consists of nn figures of animals. Figures are numbered from 11 to nn in order of the carousel moving. Thus, after the nn-th fig
阅读全文
摘要：You are given a tree consisting of nn vertices. A tree is a connected undirected graph with n−1n−1 edges. Each vertex vv of this tree has a color assi
阅读全文
摘要：恢复内容开始 D. Grid-00100 time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output A mad scientist Dr.J
阅读全文
浙公网安备 33010602011771号