POJ--Nasty Hacks;Fibonacci;Treats for the Cows;Number Triangle;The Triangle;An old Stone Game;滑雪

 Nasty Hacks:

#include <iostream> using namespace std; int main() { int a = 0; cin >> a; int b,c,d; for (int i = 0; i < a; i ++) { cin >> b >> c >> d; if ((c - d) > b) { cout<<"advertise"; } else if ((c - d) == b) { cout<<"does not matter"; } else { cout<<"do not advertise"; } cout<<endl; } return 0; }

....

//============================================================================ // Name : cc.cpp // Author : T-Bag.& // Version : No Version // Copyright : I am neu software 20063500 // Description : This is the POJ //============================================================================ #include <iostream> #include <string> #include <set> using namespace std; bool forward(int i, int j, char a[][5], string* str) { if (i - 1 < 0) { return false; } else { char c = a[i - 1][j]; str->append(&c); return true; } } bool back(int i, int j, char a[][5], string* str) { if (i + 1 > 4) { return false; } else { char c = a[i + 1][j]; str->append(&c); return true; } } bool left(int i, int j, char a[][5], string* str) { if (j - 1 < 0) { return false; } else { char c = a[i][j - 1]; str->append(&c); return true; } } bool right(int i, int j, char a[][5], string* str) { if (j + 1 > 4) { return false; } else { char c = a[i][j + 1]; str->append(&c); return true; } } set<string> s; typedef bool (*fun)(int i, int j, char a[][5], string* str); void start(int i, int j, char a[][5], set<string>* s, string* str, fun f) { if (f(i, j, a, str)) { } } int main() { char a[5][5]; for (int i = 0; i < 5; i++) { for (int j = 0; j < 5; j++) { cin >> a[i][j]; } } for (int i = 0; i < 5; i++) { for (int j = 0; j < 5; j++) { string str; start(i, j, a, &s, &str, forward); } } cout << s.size(); return 0; }

Fibonacci:

#include <iostream> using namespace std; class Matrix { private: unsigned int fn; unsigned int fn1; unsigned int fn2; unsigned int fn3; public: Matrix():fn(1),fn1(1),fn2(1),fn3(0) {} friend class Matrix; Matrix operator* (const Matrix& m) { unsigned int a = fn1*m.fn1 + fn*m.fn2; unsigned int d = fn1*m.fn + fn*m.fn3; unsigned int b = fn2*m.fn1 + fn3*m.fn2; unsigned int c = fn2*m.fn + fn3*m.fn3; fn1 = a; fn2 = b; fn3 = c; fn = d; return *this; } unsigned int getFn() { return fn; } }; int main() { unsigned int num = 0; cin >> num; while (num != -1) { if (num == 0) { cout << "0" << endl; } else { Matrix m; Matrix t; for (unsigned int i = 0; i < num-1; i ++) { m = m * t; } cout << m.getFn() % 10000 << endl; } cin >> num; } return 0; }

Treats for the Cows:

对这道题分析一下:

init数组是最先输入的数字序列,dp[i][j]表示从第i到第j位所得到的最大权值和

dp[i][j] = Max(dp[i+1][j] + init[i]*(N-j+i), dp[i][j-1] + init[j]*(N-j+i) );

dp[i+1][j] + init[i]*(N-j+i) 表示取第i个数产生的权值;

dp[i][j-1] + init[j]*(N-j+i) 表示取第j个数产生的权值.

两者取大者就是DP[i][j]的最大值

import java.util.Scanner; public class Main { public static final int MaxN = 2002; public static void main(String args[]) { int dp[][] = new int[MaxN][MaxN]; int[] init = new int[MaxN]; int N; Scanner s = new Scanner(System.in); N = s.nextInt(); int i, j; for (i = 1; i <= N; i++) init[i] = s.nextInt(); for (i = 0; i <= N + 1; i++) { for (j = 0; j <= N + 1; j++) dp[i][j] = 0; } for (i = N; i >= 1; i--) { for (j = i; j <= N; j++) { dp[i][j] = dp[i + 1][j] + init[i] * (N - j + i); if (dp[i][j - 1] + init[j] * (N - j + i) > dp[i][j]) dp[i][j] = dp[i][j - 1] + init[j] * (N - j + i); } } System.out.println((dp[1][N])); } }

 

Number Triangle:

 

#include<cstdio> const int M=1000+5; int f[M][M],a[M][M]; inline int max(int x,int y){ return x<y?y:x; } int main(){ int i,j,n; while(scanf("%d",&n)==1){ for(i=1;i<=n;i++) for(j=1;j<=i;j++) scanf("%d",&a[i][j]); for(j=1;j<=n;j++) f[n][j]=a[n][j]; for(i=n-1;i>=1;i--) for(j=1;j<=i;j++) f[i][j]=a[i][j]+max(f[i+1][j],f[i+1][j+1]); printf("%d/n",f[1][1]); } return 0; }

The Triangle

 

#include <stdio.h> #define NUM 100 int s[NUM][NUM]; int f[NUM][NUM]; int max(int a, int b) { return a > b ? a : b; } int main() { int num = 1000; scanf("%d", &num); for (int i = 0; i < num; i++) { for (int j = 0; j <= i; j++) { scanf("%d", &s[i][j]); } } for (int i = 0; i < num; i++) { f[num - 1][i] = s[num - 1][i]; } for (int i = num - 2; i >= 0; i--) { for (int j = 0; j <= i; j++) { f[i][j] = max(f[i + 1][j], f[i + 1][j + 1]) + s[i][j]; } } printf("%d", f[0][0]); return 1; }

 

An old Stone Game:（我这里，是求最大）

一直按最大的做，结果答案老师不对，最后才发现题目看错了，我晕了，也懒的改了！

#include <stdio.h> #define NUM 100 int s[NUM]; int f[NUM][NUM]; int max(int i, int j) { int max = 0; if (i == j) { return 0; } for (int k = i; k < j; k++) { if (max < f[i][k]) { max = f[i][k]; } else if (max < f[k + 1][j]) { max = f[k + 1][j]; } } return max; } ; int sum(int i, int j) { int sum = 0; if (i == j) { return 0; } for (int t = i; t <= j; t++) { sum += s[t]; } return sum; } ; int main() { int num = 1000; scanf("%d", &num); while (num != 0) { for (int i = 0; i < num; i++) { scanf("%d", &s[i]); } for (int i = 0; i < num; i++) { for (int j = 0; j < num - i; j++) { f[j][j + i] = max(j, j + i) + sum(j, j + i); } } printf("%d/n", f[0][num - 1]); for (int i = 0; i < num; i++) { for (int j = 0; j < num; j++) { f[i][j] = 0; } } scanf("%d", &num); } return 1; }

滑雪：

 这道题的思路是递归的算法，在算法中好像叫记忆法，从每个点开始递归，按照题目的规则遍历，在对应的数组加上高度，最后获得最大值就是最大的高度了，时间用了16ms，内存286kb，还是比较高的，接下来还得努力将其改进

#include<stdio.h> #define NUM 101 int height[NUM][NUM]; int flag[NUM][NUM]; int LongestLength(int i, int j, int r, int c) { int max = 0, a[4], k; if(flag[i][j] != -1) return flag[i][j]; if(i<0 || j<0 || i>=r || j>=c) return 0; else { if(height[i-1][j] >= height[i][j]) a[0] = 0; else a[0] = LongestLength(i-1, j, r, c); if(height[i+1][j] >= height[i][j]) a[1] = 0; else a[1] = LongestLength(i+1, j, r, c); if(height[i][j-1] >= height[i][j]) a[2] = 0; else a[2] = LongestLength(i, j-1, r, c); if(height[i][j+1] >= height[i][j]) a[3] = 0; else a[3] = LongestLength(i, j+1, r, c); for(k=0; k<4; k++) if(a[k] > max) max = a[k]; flag[i][j] = max + 1; return max + 1; } } int main() { int r, c, i, j, max=0; scanf("%d %d", &r, &c); for(i=0; i<r; i++) for(j=0; j<c; j++) { scanf("%d", height[i]+j); flag[i][j] = -1; } for(i=0; i<r; i++) for(j=0; j<c; j++){ int a = LongestLength(i, j, r, c); if(a > max) max = a; } printf("%d/n", max); return 0; }