- 博客(4)
- 收藏
- 关注
RSS订阅转载 POJ1338~~~~~~丑数（经典dp）
#include#include#include#includeusing namespace std;int a[1510];void s(){ int num2 = 1, num3 = 1, num4 = 1; a[1] = 1; for (int i = 2; i <= 1500; i++) { a[i] = min(a[num2] * 2, min(a[num3]
2017-02-03 08:20:27
505
转载 POJ-1088~~~~~滑雪（递归+记忆化搜索）
#include#include#includeusing namespace std;int maps[105][105];int dis[105][105] = {0};int R, C;int dfs(int x, int y){ if (dis[x][y] > 0) return dis[x][y]; int up = 1, down = 1, left = 1, ri
2017-02-01 11:09:16
292
原创 POJ-1050 To the Max~~~~~~~~
#includeusing namespace std;int N;int arr[105][105];int main(){ cin >> N; int tmp; int max = -20000; for (int j,i = 0; i < N; i++) { tmp = 0; for (j = 0; j < N; j++) { cin >> arr[i]
2017-01-31 14:37:46
227
原创 蓝桥杯~~~~~错误票据
#include#include#include#includeusing namespace std;int cmp(const void *a, const void *b){ return *(int *)a - *(int *)b;}int main(){ int m, n; int N; int b[100006]; cin >> N; int sum =
2017-01-30 15:34:07
245
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人