懂我
chen_zan_yu
一生所爱
展开
-
大砍刀
大牛:https://blog.csdn.net/liuqiyao_01/article/details/9079611原创 2018-09-24 16:50:36 · 355 阅读 · 0 评论 -
L - Common Subsequence (最长公共子序列)(18.9.28)
A subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = < x1, x2, ..., xm > another sequence Z = < z1, z2, ..., zk > is a ...原创 2018-09-28 17:41:08 · 294 阅读 · 0 评论 -
E - Super Jumping! Jumping! Jumping! (最大递增子串和)(18.9.28)
Nowadays, a kind of chess game called “Super Jumping! Jumping! Jumping!” is very popular in HDU. Maybe you are a good boy, and know little about this game, so I introduce it to you now. The game ...原创 2018-09-28 17:22:02 · 163 阅读 · 0 评论 -
K - Candies(用栈 求最短路,邻接表)
During the kindergarten days, flymouse was the monitor of his class. Occasionally the head-teacher brought the kids of flymouse’s class a large bag of candies and had flymouse distribute them. All the...原创 2018-09-22 23:50:04 · 212 阅读 · 0 评论 -
最短路径中的最大值(模板)
#include<stdio.h>#include<string.h>#include<algorithm>#include<stdlib.h>using namespace std;const int N=1005;const int inf=0x3f3f3f;int n;int vis[N];int mp[N][N];int...原创 2018-09-22 00:20:26 · 1574 阅读 · 0 评论 -
懂我(持续更新中。。。)
atoi(s)函数用于把一个字符串转换为一个整型数据,该函数定义在stdlib.h中#include<iostream.h> #include<stdlib.h> int main(){ char s[100]; int b; gets(s);b=atoi(s); cout<<b<<endl;return 0; ...原创 2018-09-21 23:18:49 · 126 阅读 · 0 评论 -
dfgdfs
#include <bits/stdc++.h>using namespace std;const int inf=0x3f3f3f;int main(){ int t;scanf("%d",&t); int s1=0,s2=0; long long sum=0; int x,n; cha...原创 2018-09-26 09:14:37 · 762 阅读 · 0 评论 -
L - PC is for kicking
StatementsOtvio is a calm guy with a guilty pleasure: kicking PCs. Now he is participating in a programming competition where the computers are arranged as a tree, that is, the NPCs are connected by...原创 2018-09-26 00:05:18 · 551 阅读 · 0 评论 -
C - Help Shahhoud (18.9.30)(字符串交换的最小次数)
Shahhoud is participating in the first Div.3 contest on Codeforces, the first problem was:Given two strings A and B of equal length N (N is odd), find the minimum number of steps needed to change A ...原创 2018-10-01 11:45:00 · 981 阅读 · 0 评论 -
E - Alarm Clock (尺取法)
题目链接:https://cn.vjudge.net/problem/CodeForces-898D Every evening Vitalya sets n alarm clocks to wake up tomorrow. Every alarm clock rings during exactly one minute and is characterized by one intege...原创 2018-09-30 12:20:48 · 289 阅读 · 0 评论