https://wiki.cvbbacm.com/ 2026-04-30T00:52:10+0800 https://wiki.cvbbacm.com/ https://wiki.cvbbacm.com/lib/exe/fetch.php?media=favicon.ico text/html 2023-07-27T18:56:12+0800 Anonymous (anonymous@undisclosed.example.com) https://wiki.cvbbacm.com/doku.php?id=2023-2024:teams:ikun_is_coding:2023-2024_buaa_xcpc_team_supplementary_training_01&rev=1690455372&do=diff A B C D E F G H I J K L text/html 2023-07-21T19:12:50+0800 Anonymous (anonymous@undisclosed.example.com) https://wiki.cvbbacm.com/doku.php?id=2023-2024:teams:ikun_is_coding:2023_%E7%89%9B%E5%AE%A2%E6%9A%91%E6%9C%9F%E5%A4%9A%E6%A0%A1%E8%AE%AD%E7%BB%83%E8%90%A5_1&rev=1689937970&do=diff A B 瞎搞题 AC代码 #include<bits/stdc++.h> #define ll long long using namespace std; const int maxn=1e6+5; ll x[maxn],y[maxn]; int n; ll getS(int a[]){ return abs(x[a[0]]*y[a[1]]-x[a[0]]*y[a[2]]+x[a[1]]*y[a[2]]-x[a[1]]*y[a[0]]+x[a[2]]*y[a[0]]-x[a[2]]*y[a[1]]); } int main(){ scanf("%d",&n); for(int i=0;i<n;i++){ scanf("%lld%lld",&x[i],&y[i]); } bool f[3]={0,0,0}; int a[3]={0,n/2,n-1},l=0,r=2,m=1; ll S=getS(a); int tmp; int b[3]={0,1,2}; while(!f[0]||!f[1]||!f[2]){ tmp=a[m]; int to=… text/html 2023-07-23T20:14:51+0800 Anonymous (anonymous@undisclosed.example.com) https://wiki.cvbbacm.com/doku.php?id=2023-2024:teams:ikun_is_coding:2023_%E7%89%9B%E5%AE%A2%E6%9A%91%E6%9C%9F%E5%A4%9A%E6%A0%A1%E8%AE%AD%E7%BB%83%E8%90%A5_2&rev=1690114491&do=diff A B 树剖+线段树+网络流（最大权闭合子图） 给定一棵n个节点的树，有边权（维护成本），给定m组顶点，代表一条线路，同时给出了该线路带来的利润。可以删除树上的边，以及放弃若干条线路，求：最大利润。 text/html 2023-07-27T18:55:07+0800 Anonymous (anonymous@undisclosed.example.com) https://wiki.cvbbacm.com/doku.php?id=2023-2024:teams:ikun_is_coding:front_page&rev=1690455307&do=diff 唱跳rap打代码 训练记录 比赛时间 比赛名称 赛中过题 总计过题 题目总数 校内排名 总榜排名 23.07.17 2023 牛客暑期多校训练营 1 4 9 13 11/14 206/1505 23.07.21 2023 牛客暑期多校训练营 2 6 - 13 9/14 165/1526