HackerRank Truck Tour

题目链接

#include<stdio.h>int FindMin(int *queue, int n)
{long long sum = 0;int i = 0, j = 0;for (; i < n; i++){sum += queue[i];if (sum < 0){sum = 0;j = i + 1;}}return j;
}int main()
{int i, n, num, dis;int queue[100001];scanf("%d", &n);for (i = 0; i < n; i++){scanf("%d%d", &num, &dis);queue[i] = num - dis;}printf("%d\n", FindMin(queue, n));return 0;
}

HackerRank Truck Tour相关推荐

usaco Canada Tour
没想到用dp,写完才发现这就是floyd求最大环..... /* ID:jinbo wu TASK:tour LANG:C++ */ #include<bits/stdc++.h> usi ...
Codeforces 894.D Ralph And His Tour in Binary Country
D. Ralph And His Tour in Binary Country time limit per test 2.5 seconds memory limit per test 512 me ...
HackerRank：JavaScript 是最知名的编程语言
开发四年只会写业务代码,分布式高并发都不会还做程序员? HackerRank 于昨日发布了 2019 年版的年度<开发者技能报告>,报告调查了来自 100 多个国家的 71000 余名 ...
poj 2677 tour
2019独角兽企业重金招聘Python工程师标准>>> /*G:Tour查看提交统计提问总时间限制: 1000ms内存限制: 65536kB 描述 John Doe, a skill ...
Bzoj3060 [Poi2012]Tour de Byteotia
3060: [Poi2012]Tour de Byteotia Time Limit: 30 Sec Memory Limit: 256 MB Submit: 251 Solved: 161 De ...
hackerrank杂记
https://www.hackerrank.com/challenges/py-set-discard-remove-pop/forum 知识点: *list:将list中的值取出,取出的数据大小是 ...
HackerRank Gift Boxes(hash)
在当前计算的长度不小于g字符串长度时,需要比较c串对应长度的哈希值与g的哈希值,如果相同,则需要更新当前的计算哈希的下标. 代码参考: OJ/hackerrank/Gift Boxes at mast ...
（最小生成树）Truck History --POJ -- 1789
链接: http://poj.org/problem?id=1789 Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 2213 ...
Hackerrank - The Grid Search
https://www.hackerrank.com/challenges/the-grid-search/forum 今天碰见这题,看见难度是Moderate,觉得应该能半小时内搞定. 读完题目发现 ...

HackerRank Truck Tour

HackerRank Truck Tour相关推荐

最新文章

热门文章