fan233的博客

哈希表没有裸题。。。初学蒟蒻只好自己瞎搞搞。。。大神勿喷。。var  i,j,k,t,n,m,x:longint;  a:array[1..100]of longint;function hash(x:longint):longint;  begin    hash:=x mod 12;  end;function locate(x:longint)

/*#include#include#includeusing namespace std;long long n,m;int main(){ freopen("remainders.in","r",stdin); freopen("remainders.out","w",stdout); scanf("%lld%lld",&n,&m); long long sum=0; i

第一次n2华丽丽的tle。大佬教了o（n）的求最长递增序列的方法%%%%#include#include#includeusing namespace std;int n,a[50001],f[50001];int main(){ scanf("%d",&n); for (int i=1;i<=n;i++) scanf("%d",&a[i]); int maxn=0;

D - Codeforces 725DOne tradition of ACM-ICPC contests is that a team gets a balloon for every solved problem. We assume that the submission time doesn't matter and teams are sorted only by t

光棍节打NOIP。。。T1 有毒的T1。第一眼看去以为扩欧或者什么数论。。看了一会儿没什么想法就先过了。后来回头打了暴力。。。出来以后就跟我说T1规律ans=n*m-n-m。。当时心态瞬间爆炸。。。完了呀。。T2大模拟。感觉过了两个样例也不是很确定。。看了一会儿也看不出什么名堂。就这么交了。。。T3看看时间不够。。先打了个暴力。。完了一看数据范围