1006 - Sign In and Sign Out (25)
把数据过滤两遍,一遍找最早来的,一遍找最晚走的就行了。
#include <bits/stdc++.h>
using namespace std;
class Sign{
public:
string id;
int in_h;
int in_m;
int in_s;
int out_h;
int out_m;
int out_s;
};
int main()
{
int n, i, earliest = 0, latest = 0;
cin >> n;
Sign *s = new Sign[n];
for(i = 0; i < n; i++){
cin >> s[i].id;
scanf("%d:%d:%d %d:%d:%d", &s[i].in_h, &s[i].in_m, &s[i].in_s,
&s[i].out_h, &s[i].out_m, &s[i].out_s);
}
for(i = 1; i < n; i++)
{
if(s[earliest].in_h > s[i].in_h){
earliest = i;
}else if(s[earliest].in_h < s[i].in_h){
continue;
}else{
if(s[earliest].in_m > s[i].in_m){
earliest = i;
}else if(s[earliest].in_m < s[i].in_m){
continue;
}else{
if(s[earliest].in_s > s[i].in_s){
earliest = i;
}else if(s[earliest].in_s < s[i].in_s){
continue;
}
}
}
}
for(i = 1; i < n; i++){
if(s[latest].out_h < s[i].out_h){
latest = i;
}else if(s[latest].out_h > s[i].out_h){
continue;
}else{
if(s[latest].out_m < s[i].out_m){
latest = i;
}else if(s[latest].out_m > s[i].out_m){
continue;
}else{
if(s[latest].out_s < s[i].out_s){
latest = i;
}else if(s[latest].out_s > s[i].out_s){
continue;
}
}
}
}
cout << s[earliest].id << " " << s[latest].id;
return 0;
}
1007 - Maximum Subsequence Sum (25)
最简单的方法是从每个元素开始,向后周游,求出最大值比较,时间复杂度为N方。把时间度复杂度将为线性的方法是找出它的递推规则:从第一个元素开始,向后叠加。如果当前的max大于旧的max,更新max、左边界和有边界;如果当前max小于0,临时左边界更新为下一个元素的索引,当前max更新为0。
#include <bits/stdc++.h>
using namespace std;
int main()
{
int v[10000];
int i, n, max = -1, left = 0, right = 0,
tempmax = 0, templeft = 0;
cin >> n;
for(i = 0; i < n; i++){
cin >> v[i];
tempmax += v[i];
if(tempmax < 0){
templeft = i + 1;
tempmax = 0;
}else if(tempmax > max){
max = tempmax;
left = templeft;
right = i;
}
}
if(max < 0)
cout << 0 << " " << v[0] << " " << v[n-1];
else
cout << max << " " << v[left] << " " << v[right];
return 0;
}
1008 - Elevator (20)
暴力求解就行…
#include <iostream>
using namespace std;
int main()
{
int n, temp, i, pre = 0, sum = 0;
cin >> n;
for(i = 0; i < n; i++){
cin >> temp;
int dis = temp - pre;
sum += dis > 0? dis * 6: -dis * 4;
sum += 5;
pre = temp;
}
cout << sum;
return 0;
}
1009 - Product of Polynomials (25)
输入两个多项式,使用数组的索引作为幂。数学规则是:幂指数相加,系数相乘。
#include <iostream>
using namespace std;
int main()
{
double p[2010], c, r[2010] = {0};
int tt[2010];
int m, n, i, e, j, cnt = 0;
cin >> m;
for(i = 0; i < m; i++){
cin >> tt[i];
cin >> p[tt[i]];
}
cin >> n;
for(i = 0; i < n; i++){
cin >> e >> c;
for(j = 0; j < m; j++)
r[tt[j] + e] += c * p[tt[j]];
}
for(i = 0; i < 2010; i++)
if(r[i] != 0.0)
tt[cnt++] = i;
cout << cnt;
for(i = cnt - 1; i >= 0; i--)
printf(" %d %.1f", tt[i], r[tt[i]]);
return 0;
}
1010 - Radix (25)
首先把给定进制的数转换成十进制(设为sum),然后另一个数从1开始,向上搜索,相等时输出且退出,但上限是sum,否则输出Impossible。不过这样时间复杂度为线性,太高。使用二分法可以把时间复杂度将为log2(n),可以知道下限是另一个数值的最大字符对应的数字 + 1。又由于0-9对应0-9,a-z对应10-35,每次都用三元运算发判断一次太麻烦,创建一个map来保存。同时还有一件事:字符串转换成十进制后会超出long的范围,超出后StringtoDecimal()方法返回的是负数,此时在题意中被理解为没有寻找出进制,二分法中需要减小进制(本人认为是一个bug)。
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
public class Main {
static Map<Character, Integer> map = new HashMap();
public static void main(String[] args) {
Scanner cin = new Scanner(System.in);
int i;
String val1, val2, choose;
long tag, radix, sum = 0, tempradix = 1, len;
for(i = 0; i < 10; i++)
map.put((char)(i + 48), i);
for(i = 10; i <= 35; i++)
map.put((char)(i + 87), i);
val1 = cin.next();
val2 = cin.next();
tag = cin.nextInt();
radix = cin.nextInt();
choose = (tag == 1?val1:val2);
sum = StringtoDecimal(choose, radix);
choose = choose.equals(val1) ? val2 : val1;
len = choose.length();
char min = '0';
for(i = 0; i < len; i++)
if(choose.charAt(i) > min)
min = choose.charAt(i);
long mmin = min > '9' ? (int)min - 87 + 1:(int)min-48 + 1;
long mmax = sum+1;
while(mmin <= mmax) {
tempradix = (mmin + mmax)/2;
long sum2 = StringtoDecimal(choose, tempradix);
if(sum2 < 0 || sum2 > sum) {
mmax = tempradix - 1;
}else if(sum2 < sum) {
mmin = tempradix + 1;
}else {
System.out.println(tempradix);
return;
}
}
System.out.println("Impossible");
}
private static long StringtoDecimal(String str, long radix) {
long len = str.length(), sum = 0;
for(int i = 0; i < len; i++)
sum = (sum + map.get(str.charAt(i))) * radix;
return sum/radix;
}
}