![](https://img-blog.csdnimg.cn/20201014180756913.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
HDU
DovahkiinGA
这个作者很懒,什么都没留下…
展开
-
HDU 1003 Max Sum(DP入门)
#include<bits/stdc++.h>using namespace std;long long max(long long x,long long y){ return x>y?x:y;}int t,o,i,dp[99999],st[99999],a[99999],maxx,n;int main(){ cin>>t; for(o=1;o<=t;o++) { cin>>n; for(i=1;i<=n;i++) .原创 2021-03-15 20:26:17 · 53 阅读 · 0 评论 -
HDU 1004 Let the Balloon Rise(字符串排序)
Problem DescriptionContest time again! How excited it is to see balloons floating around. But to tell you a secret, the judges' favorite time is guessing the most popular problem. When the contest is over, they will count the balloons of each color and f原创 2021-03-15 19:25:13 · 73 阅读 · 0 评论 -
HDU 1005 Number Sequence优化暴力
Problem DescriptionA number sequence is defined as follows:f(1) = 1, f(2) = 1, f(n) = (A * f(n - 1) + B * f(n - 2)) mod 7.Given A, B, and n, you are to calculate the value of f(n).InputThe input consists of multiple test cases. Each test case..原创 2021-03-15 19:07:15 · 71 阅读 · 0 评论 -
HDU 5938 Four Operations(暴力+贪心)
Problem DescriptionLittle Ruins is a studious boy, recently he learned the four operations!Now he want to use four operations to generate a number, he takes a string which only contains digits'1'-'9', and split it into5intervals and add the four op...原创 2021-03-15 15:14:11 · 106 阅读 · 0 评论