tiutiu2011-优快云博客

原创 Building Your First App

This works fine for the button, but not as well for the text field, because the user might type something longer. It would be nice to fill the unused screen width with the text field. You can do this

2015-12-06 15:30:17 456

转载 Android Studio 设置内存大小及原理，优化运行速度

Android studio 1.0.2默认最大内存是750M，这样跑起来非常的卡，难以忍受，机器又不是固态硬盘，最后发现，这个默认值是可以修改的，在android studio目录下找到：studio64.exe.vmoptions文件，绿色部分为修改的参数（-Xmx1050m)，将默认参数修改为1050MB，这样跑起来就非常流畅了，如果觉得还是不够流畅，可以改得更高：-Xms128

2015-12-06 15:22:50 5715

原创 URAL 1684 Jack's Last Word

#include#define MAX_LONG 75001char T[MAX_LONG << 1];char S[MAX_LONG];int next[MAX_LONG << 1];int flag[MAX_LONG];int getLen(char *string){ char *p = string; while (*p != '\0'){ p++; } re

2015-11-22 22:46:11 416

原创 URAL 1684 Jack's Last Word

#include#define MAX_LONG 75001char S[MAX_LONG];char T[MAX_LONG];int next[MAX_LONG];int subStrLen[MAX_LONG];int numOfSubStrs;int getLen(char *string){ char *p = string; while (*p != '\0'){

2015-11-22 22:45:32 367

原创 URAL 1423 String Tale

#include#define MAX_LONG 250001int N;char S[MAX_LONG * 2];char T[MAX_LONG];int next[MAX_LONG];int main(){ scanf("%d %s %s", &N, S, T); int len = N * 2; int i; for (i = 0; i < N; i++){

2015-11-22 19:27:51 421

原创 URAL 1354 Palindrome. Again Palindrome (回文 + KMP)

#include char string[10001];char reverseString[10001];int next[10001];int main(){ scanf("%s", string); int len = 0; int index; for (index = 0; string[index] != '\0'; index++){ len++; }

2015-11-20 00:05:53 403

原创 URAL 1297 Palindrome (回文+中心扩展)

#include char string[1001];int main(){ scanf("%s", string); int len = 0; int i; for (i = 0; string[i] != '\0'; i++) len++; int maxLen = 0; int start; int mid, left, right; for (mid =

2015-11-19 19:00:40 291

原创 URAL 1723 Sandro's Book

#include char string[51];int letterCount[26];int main(){ scanf("%s\n", string); int i; for (i = 0; string[i] != '\0'; i++) letterCount[string[i] - 'a']++; int maxCount = -1; int spell;

2015-11-19 16:42:20 492

原创 URAL 1279 Warehouse

#include #define MAX_HIGHT 1000int numOfRows, numOfColumns, numOfNewContainers;int sections[MAX_HIGHT + 1];int result;int main(){ scanf("%d%d%d", &numOfRows, &numOfColumns, &numOfNe

2015-11-06 09:11:17 429

原创 URAL 1534 Football in Gondor

#include long long scoredBalls, missedBalls;long long numOfMatches;long long max, min;int main(){ scanf("%lld%lld%lld", &scoredBalls, &missedBalls, &numOfMatches); long long leftScoredBa

2015-11-05 11:00:18 486

原创 POJ 3687 Labeling Balls (反向拓扑排序)

#include #define MAX_LABEL 200#define MAX_WEIGHT 200#define MAX_CONSTAINS 40000int numOfBalls, numOfConstrains;int maxLabel, maxWeight;int lighter, heavier;int fail;int label, weight;int wei

2015-11-03 19:32:25 719

原创 HDU 1688 Sightseeing

#include #define MAX_CITIES 1000#define MAX_ROADS 10000#define INF 1000000int numOfCities, numOfRoads;typedef struct Road{ int to; int len; int next;}Road;Road RoadArray[MAX_RO

2015-11-02 15:33:05 628

原创 Binder进程间通信机制的Client进程和Server进程的通信过程

读书笔记——Binder进程间通信机制的Client进程和Server进程的一次进程间通信过程

2015-10-30 14:02:22 1012

原创 Handler消息处理机制

public void dispatchMessage(Message msg) { if (msg.callback != null) { //通过post(Runable r)发送消息，会把Runable 封装成 Message，最后调用handlerCallback来处理消息 handleCallback(msg); } e

2015-10-25 17:07:16 597

原创 Zygote进程启动System Server进程的过程

Android系统启动时，Init进程会把Zygote进程启动起来，而Zygote进程会把System Server进程启动起来。

2015-10-25 16:56:47 503

原创 Activity组件启动过程

Android系统的Activity组件负责管理Android应用程序的用户界面。运行在不同进程中的Activity组件通过Binder进程间通信机制来协作完成任务。从应用程序的角度出发，Activity组件可以分为根Activity和子Activity。根Activity以快捷图标的形式显示在应用程序启动器中，它的启动过程就代表一个Android应用程序的启动

2015-10-24 14:17:25 477

原创 Android应用程序线程的消息循环模型

读书笔记——《Android系统源代码情景分析》第15章Android应用程序线程的消息循环模型

2015-10-24 13:51:18 903

原创 Android应用程序的消息处理机制

读书笔记——《Android系统源代码情景分析》第13章Android应用程序的消息处理机制

2015-10-24 09:13:35 421

原创 URAL 1282 Game Tree

#include #define MAX_NODES 1001int numOfNodes;int resultOfLeaf[MAX_NODES];typedef struct Edge{ int to; int next;}Edge;Edge EdgeArray[MAX_NODES];int EdgeNum;int head[MAX_NODES];

2015-10-23 11:03:14 420

原创 URAL 1018 Binary Apple Tree (树形DP)

#include #define MAX_POINTS 100#define MAX(x, y) ( (x) > (y) ? (x) : (y) )typedef struct Branch{int to;int apples;int next;}Branch;Branch BranchArray[MAX_POINTS * 2];int BranchNu

2015-10-23 09:46:50 430

原创 URAL 1018 Binary Apple Tree (树形DP)

#include #define MAX_POINTS 100#define MAX(x, y) ( (x) > (y) ? (x) : (y) )typedef struct Branch{ int to; int apples; int next;}Branch;Branch BranchArray[MAX_POINTS * 2];int BranchNum;int he

2015-10-22 17:09:26 371

原创 Init进程启动Zygote进程的过程

Android系统启动时在加载完内核之后会启动Init进程，Init进程的启动过程中会读取根目录下的脚本文件Init.rc，以便将Zygote进程启动起来。 //Android系统在加载内核之后会启动init进程，以下为Init进程的main函数int main(int argc, char **argv){ int fd_count = 0; st

2015-10-21 22:31:08 839

原创 POJ 3253 Fence Repair (霍夫曼编码 + 最小堆)

#include #define MAX_PLANKS 20000int numOfPlanks;long long length[MAX_PLANKS + 1];int heapSize;void swap(long long *a, long long *b){ long long c = *a; *a = *b; *b = c;}int getParent(int

2015-10-21 16:54:59 452

原创 POJ 2623 Crashing Robots

#include #define MAX 101int testCases;int xLen, yLen;int occupied[MAX][MAX];int numOfRobots, numOfInstructions;char initailDirection[2];int startDirection[MAX];int robot, repeat;char action[

2015-10-21 15:36:31 343

原创单例模式singleton

/*单例模式，singleton，保证一个类仅有一个实例，并提供一个访问它的全局访问点*/public class Singleton { //声明一个私有的静态类对象 private volatile static Singleton singleton; //构造函数私有，不能在类的外部创建新的对象 private Singleton(){}; //为创建新的对象提供一个对外的公

2015-10-20 16:41:04 265

原创 POJ 1734 Sightseeing Trip (最小环)

#include #define MAX_POINTS 101#define INF 300000int numOfPoints, numOfRoads;int initialDist[MAX_POINTS][MAX_POINTS];int shortestDist[MAX_POINTS][MAX_POINTS];int pre[MAX_POINTS][MAX_POINTS];in

2015-10-20 10:56:20 349

原创 Android UI 的单位和概念

1. pxPixels，像素，1px代表屏幕一个物理像素点。2. resolutionResolution,分辨率，在屏幕上显示的物理像素的总和，宽×高表示。3. densityDensity，单位屏幕面积上显示的像素数量。4. dpiDots Per Inch，每英寸像素数。5. dipDevice Independent Pixels,设备无关像素，也叫dp

2015-10-20 08:43:56 543

原创 URAL 1039 Anniversary Party (树形DP)

#include #define MAX_EMPLOYEES 6000#define MAX(x, y) ( (x) > (y) ? (x) : (y) )int numOfEmployees;int convivialityRate[MAX_EMPLOYEES + 1];typedef struct Subordinate{ int subordinate; int next;

2015-10-19 17:35:34 346

原创 URAL 1152 False Mirrors (DFS枚举)

#include #define MAX_BALCONIES 20#define INF 0xFFFFFFFFint numOfBalconies;int monstersArray[MAX_BALCONIES + 1];int numOfMonsters;int minDamage;void shoot(int monstersLeft, int currentDamage){

2015-10-19 16:22:06 438

原创 HDU 1054 Strategic Game (树形DP)

#include #define MAX_NODES 1500#define MIN(x, y) ( (x) < (y) ? (x) : (y) )int numOfNodes;int root;int numOfRoads;typedef struct Road{ int to; int next;}Road;Road RoadArray[MAX_NODES * MAX_N

2015-10-19 14:22:47 333

原创《编程之美》求二进制数中1的个数

#include //常规解法，求余运算比较耗时可优化int countV1(int num){ int result = 0; while (num){ if (num % 2) result++; num /= 2; } return result;}//用位运算优化int countV2(int num){ int result = 0; while

2015-10-19 11:19:24 333

原创 USACO 3.1 Stamps

#include #define DEBUG 1#define TESTCASES 9#define MAX_VALUES 50#define MAX_TOTALVALUE 2000000int valueArray[MAX_VALUES + 1];int numOfStamps, numOfValues;int minStampsArray[MAX_TOTALVALUE + 1]

2015-10-18 19:20:00 359

原创 USACO 3.1 Humble Numbers

#include #define DEBUG 1#define TESTCASES 9#define MAX_PRIMES 100#define MAX_N 100000//注意别开小了#define INF 0xFFFFFFFFint numOfPrimes, Nth;long long primeArray[MAX_PRIMES + 1];long long humble

2015-10-18 17:25:51 372

原创 USACO 3.1 Score Inflation (完全背包)

#include #define DEBUG 1#define TESTCASES 9#define MAX 10000int contestMinutes, numOfClasses;int pointArray[MAX + 1];int minuteArray[MAX + 1];int maxPoints[MAX + 1];int main(){#if DEBUG in

2015-10-17 21:35:57 411

原创 POJ 1125 Stockbroker Grapevine (FloydWarshall 所有点对最短路径)

#include #define MAX_STOCKBROKERS 101//10 minutes * 100 stockBrokers + 1#define MAX_MINUTES 1001int numOfStockBrokers;int numOfContracts;int from, to, pass;int minutes;int time[MAX_S

2015-10-16 10:13:50 328

原创二分搜索

#include /*V0版本是原生的二分搜索*/int binarySearch_V0(int sortedArray[], int size, int value){ int first = 0; int last = size - 1; int mid; //循环不变式是：right && sortedArray[first] < value && value < sorted

2015-10-15 13:10:08 327

原创 URAL 1156 Two Rounds (DFS二分染色 + 分组背包)

#include #define MAX 110int numOfTasks, numOfPairs;int numOfProblems;typedef struct Node{ int to; int next;}Node;//用邻接链表存储题目//注意数组别开小了，千万别只是开MAX的大小！！！Node NodeArray[MAX * 2];int numOfNodes

2015-10-15 10:32:49 448

原创 HDU 1712 ACboy needs your help (分组背包)

#include #define MAX 101int numOfCourses, mostDays;int profit[MAX][MAX];int maxProfit[MAX];int main(){ while (scanf("%d%d", &numOfCourses, &mostDays) != EOF){ if (numOfCourses == 0 && most

2015-10-14 23:18:58 237

原创 URAL 1156 Two Rounds (DFS二分染色 + DFS枚举 + 剪枝)

#include #define MAX 110int numOfTasks, numOfPairs;int numOfProblems;typedef struct Node{ int to; int next;}Node;//用邻接链表存储题目//注意数组别开小了，千万别只是开MAX的大小！！！Node NodeArray[MAX * 2];int numOfNodes

2015-10-14 14:42:03 475

原创 URAL 1221 Malevich Strikes Back! (DP动态规划 O(n^2) )

#include #define MAX_SIZE 101#define MIN(x, y) ( (x) < (y) ? (x) : (y) )int paper[MAX_SIZE][MAX_SIZE];//存储从左上left top 到右下 right bottom的扫描结果int lt2rb[MAX_SIZE][MAX_SIZE];int lb2rt[MAX_SIZE][MAX_S

2015-10-14 09:47:11 716

空空如也

空空如也