ID | Problem Show tags Hide tags | AC / Tried | Difficulty | |
---|---|---|---|---|
6864 | T1259 【例9.3】求最长不下降序列 | 0 / 0 | (None) | |
6865 | T1260 【例9.4】拦截导弹(Noip1999) | 1 / 1 | 10 | |
6866 | T1264 【例9.8】合唱队形 | 1 / 1 | 10 | |
6870 | T1274 【例9.18】合并石子 | 0 / 0 | (None) | |
6867 | T1281 最长上升子序列 | 0 / 0 | (None) | |
6868 | T1297 最长公共子序列 | 2 / 7 | 10 | |
6852 | T1336 【例3-1】找树根和孩子 | 2 / 3 | 10 | |
6853 | T1338 【例3-3】医院设置 | 0 / 0 | (None) | |
6854 | T1339 【例3-4】求后序遍历 | 2 / 2 | 10 | |
6855 | T1340 【例3-5】扩展二叉树 | 1 / 1 | 10 | |
6883 | T1342 【例4-1】最短路径问题 | 7 / 57 | 8 | |
6884 | T1343 【例4-2】牛的旅行 | 0 / 0 | (None) | |
6885 | T1345 【例4-6】香甜的黄油 | 3 / 8 | 10 | |
6858 | T1348 【例4-9】城市公交网建设问题 | 2 / 5 | 10 | |
6859 | T1350 【例4-11】最短网络(agrinet) | 1 / 2 | 10 | |
6856 | T1365 FBI树(fbi) | 0 / 1 | 10 | |
6871 | T1369 合并果子(fruit) | 0 / 0 | (None) | |
6886 | T1376 信使(msner) | 4 / 10 | 9 | |
6887 | T1377 最优乘车(travel) | 2 / 6 | 10 | |
6860 | T1391 局域网(net) | 2 / 2 | 10 |
By signing up a 追梦算法网 universal account, you can submit code and join discussions in all online judging services provided by us.