ural 1869. New Year Cruise
2013-08-31 11:30
465 查看
题目链接:http://acm.timus.ru/problem.aspx?space=1&num=1869
描述:从Vladivostok站Moscow站共有n个站台,Vladivostok记为1,Moscow记为n,火车来回往返。现在给出从车站i到车站j和j到i的买票人数,计算需要的最少节车厢。
思路:水题,模拟即可。注意先下后上,用一个max保持最大的人数。
代码:
//g++ 4.7.2 用到了变长数组
#include <cstdio>
int main()
{
int n;
scanf("%d", &n);
int a[n+1][n+1];
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j)
scanf("%d", &a[i][j]);
int max = 0, sum = 0;
for (int i = 1; i <= n; ++i)
{
for (int t = 1; t < i; ++t)
sum -= a[t][i];
for (int j = i + 1; j <= n; ++j)
{
sum += a[i][j];
if (sum > max)
max = sum;
}
}
sum = 0;
for (int i = n; i >= 1; --i)
{
for (int t = n; t > i; --t)
sum -= a[t][i];
for (int j = i - 1; j >= 1; --j)
{
sum += a[i][j];
if (sum > max)
max = sum;
}
}
printf("%d\n", max % 36 == 0 ? max / 36 : max / 36 + 1);
return 0;
}
描述:从Vladivostok站Moscow站共有n个站台,Vladivostok记为1,Moscow记为n,火车来回往返。现在给出从车站i到车站j和j到i的买票人数,计算需要的最少节车厢。
思路:水题,模拟即可。注意先下后上,用一个max保持最大的人数。
代码:
//g++ 4.7.2 用到了变长数组
#include <cstdio>
int main()
{
int n;
scanf("%d", &n);
int a[n+1][n+1];
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j)
scanf("%d", &a[i][j]);
int max = 0, sum = 0;
for (int i = 1; i <= n; ++i)
{
for (int t = 1; t < i; ++t)
sum -= a[t][i];
for (int j = i + 1; j <= n; ++j)
{
sum += a[i][j];
if (sum > max)
max = sum;
}
}
sum = 0;
for (int i = n; i >= 1; --i)
{
for (int t = n; t > i; --t)
sum -= a[t][i];
for (int j = i - 1; j >= 1; --j)
{
sum += a[i][j];
if (sum > max)
max = sum;
}
}
printf("%d\n", max % 36 == 0 ? max / 36 : max / 36 + 1);
return 0;
}
相关文章推荐
- URAL1297(Manacher算法)
- URAL 1841|Cableways|...
- ural 1018 二*苹果树
- Ural 1117 Hierarchy
- Ural1519 Formula 1 插头dp
- URAL 1014
- URAL 2035 Another Dress Rehearsal 水题、易错
- URAL 1294
- URAL 1826 贪心经典题型
- URAL 2080 莫队
- URAL 2070 Interesting Numbers (找规律)
- URAL 2062 Ambitious Experiment(树状数组)
- URAL 1020 Rope 简单几何
- ural 1542 字典树(思维)
- ural 1104. Don’t Ask Woman about Her Age暴力
- 【URAL 1018】Binary Apple Tree
- Ural1297Palindrome最长回文串.manacher解法
- URAL 1160 Network(最小生成树)
- URAL 1085 Meeting(最短路)
- 【URAL 1900】Brainwashing Device(预处理区间和+DP)