ural 1910. Titan Ruins: Hidden Entrance(Titan Ruins系列题目)
来源:互联网 发布:数据成熟度模型 编辑:程序博客网 时间:2024/06/05 10:00
这是Titan Ruins系列第一道题,以后慢慢更新。
赤裸裸滴阅读理解题,大意就是找到三个连在一起的数,使其之和最大,输出的第一个数是这三个数的和,第二个数是中间那个数所在的位置。水题一道,很简单。
1 #include <iostream> 2 #include <vector> 3 using namespace std; 4 int main() 5 { 6 int n; 7 cin >> n; 8 int *a = new int[n+1]; 9 for (int i = 1; i <= n; ++i)10 cin >> a[i];11 int max = 0;12 int index = 0;13 for (int i = 1; i <= n-2; ++i)14 {15 int sum = a[i] + a[i+1] + a[i+2];16 {17 if (sum > max)18 {19 max = sum;20 index = i+1;21 }22 }23 }24 cout << max << " " << index << endl;25 return 0;26 }
- ural 1910. Titan Ruins: Hidden Entrance(Titan Ruins系列题目)
- Ural 1910. Titan Ruins: Hidden Entrance
- Ural 1910. Titan Ruins: Hidden Entrance
- URAL 1910. Titan Ruins: Hidden Entrance
- URAL 1910. Titan Ruins: Hidden Entrance
- URAL 1910 Titan Ruins: Hidden Entrance
- URAL 1910 Titan Ruins: Hidden Entrance (阅读理解)
- ural 1917. Titan Ruins: Deadly Accuracy(Titan Ruins系列)
- URAL 1910 Titan Ruins: Hidden Entrance 题解与翻译
- ural 1915. Titan Ruins: Reconstruction of Bygones
- URAL:1917 Titan Ruins: Deadly Accuracy
- URAL - 1917 Titan Ruins: Deadly Accuracy(水题)
- URAL 1915 Titan Ruins: Reconstruction of Bygones(思路)
- URAL - 1920 Titan Ruins: the Infinite Power of Magic(乱搞)
- URAL 1915 Titan Ruins: Reconstruction of Bygones (栈)
- URAL 1920 Titan Ruins: the Infinite Power of Magic
- ural 1915 Titan Ruins: Repeating Success and Failure
- Ural 1917 Titan Ruins: Better late than killed
- ural 1024. Permutations
- hdu 1518 Square(dfs)
- bjfu 1143 小蝌蚪安家(bfs入门)
- 并查集入门
- hdu 1026 Ignatius and the Princess I(bfs+priority_queue)
- ural 1910. Titan Ruins: Hidden Entrance(Titan Ruins系列题目)
- C++函数对象count_if用法(转)
- ural 1917. Titan Ruins: Deadly Accuracy(Titan Ruins系列)
- oracle 几个用户的默认密码及修改
- ural 1915. Titan Ruins: Reconstruction of Bygones
- Linux(ubnutu)下编写运行c,c++程序的方法gcc+gdb+make(图示)
- vi常用命令
- c和c++关于负数取模的问题
- freopen()函数