摘要：
3043: IncDec SequenceTime Limit:10 SecMemory Limit:128 MBSubmit:13Solved:6[Submit][Status][Discuss]Description给定一个长度为n的数列{a1,a2...an}，每次可以选择一个区间[l,r]，使这个区间内的数都加一或者都减一。问至少需要多少次操作才能使数列中的所有数都一样,并求出在保证最少次数的前提下,最终得到的数列有多少种。Input第一行一个正整数n接下来n行,每行一个整数,第i+1行的整数表示ai。。Output第一行输出最少操作次数第二行输出最终能得到多少种结果Sample In 阅读全文
摘要：
Communication SystemTime Limit:1000MSMemory Limit:10000KTotal Submissions:19667Accepted:6956Description We have received an order from Pizoor Communications Inc. for a special communication system. The system consists of several devices. For each device, we are free to choose from several manufactur 阅读全文
摘要：
从百度文库上找到的，嗯，花个一周两周的时间做一做DP题。※最近更新：Poj斜率优化题目1180，2018，3709列表一：经典题目题号：容易：1018,1050,1083,1088,1125,1143,1157,1163,1178,1179,1189,1191,1208,1276,1322,1414,1456,1458,1609,1644,1664,1690,1699,1740,1742,1887,1926,1936,1952,1953,1958,1959,1962,1975,1989,2018,2029,2039,2063,2081,2082,2181,2184,2192,2231,2279 阅读全文